/*****************************************
Note  :
******************************************/
#include <queue>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
#define LL long long
#define IL inline
const int N = 1e6+10;
const int INF = 0x3f3f3f3f;
using namespace std;
IL int read()
{
    char ch = getchar();
    int f = 1, num = 0;
    while(ch>'9'||ch<'0')
    {
        if(ch=='-') f = -1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
        num = num*10+ch-'0', ch = getchar();
    return num*f;
}
int n,q;
int mn[N],stk[N],tp;
string s;
int rt[N],ls[N*4],rs[N*4],sum[N*4],tot;
void upd(int la,int ne,int l,int r,int x)
{
    sum[ne]=sum[la]+1;
    if(l==r)
        return;
    ls[ne]=ls[la],rs[ne]=rs[la];
    int mid=l+r>>1;
    if(x<=mid)
    {
        ls[ne]=++tot;
        upd(ls[la],ls[ne],l,mid,x);
    }
    else
    {
        rs[ne]=++tot;
        upd(rs[la],rs[ne],mid+1,r,x);
    }
}
int qsum(int la,int ne,int l,int r,int L,int R)
{
//    printf("%d %d %d %d\n",l,r,sum[ne],sum[la]);
    if(L<=l&&r<=R)
        return sum[ne]-sum[la];
    int mid=l+r>>1,res=0;
    if(L<=mid)
        res+=qsum(ls[la],ls[ne],l,mid,L,R);
    if(R>mid)
        res+=qsum(rs[la],rs[ne],mid+1,r,L,R);
    return res;
}
int main()
{
	cin>>s;
	n=s.size();
	memset(mn,0x3f,sizeof(mn));
	for(int i = 0;i<n;i++)
    {
        if(s[i]=='(')
            stk[++tp]=i+1;
        else
        {
            if(tp)
                mn[stk[tp--]]=i+1;
        }
    }
    rt[0]=++tot;
    for(int i = 1;i<=n;i++)
    {
        if(mn[i]<=n)
        {
            rt[i]=++tot;
            upd(rt[i-1],rt[i],1,n,mn[i]);
//            printf("%d %d\n",i,mn[i]);
        }
        else rt[i]=rt[i-1];
    }
	q=read();
	while(q--)
    {
        int l=read(),r=read();
//        printf("rt:%d %d\n",rt[l-1],rt[r]);
        int res=qsum(rt[l-1],rt[r],1,n,1,r)*2;
        printf("%d\n",res);
    }
}