#include<bits/stdc++.h>
using namespace std;
int n,q;
const int MAXN = 1e6+10;
char s[MAXN];
int pl[MAXN],pr[MAXN];
vector<int>is;
struct node{
    int l,r;
    int sum;
}tree[MAXN<<2];
#define ls(p)(p<<1)
#define rs(p)(p<<1|1)
void build(int p,int l,int r){
    tree[p].l=l,tree[p].r=r;int mid=(l+r)>>1;
    if(l==r){
        return ;
    }build(ls(p),l,mid),build(rs(p),mid+1,r);
}
void Insert(int p,int id,int v){
    int l=tree[p].l,r=tree[p].r,mid=(l+r)>>1;
    if(l==r){tree[p].sum=v;return ;}
    if(id<=mid)Insert(ls(p),id,v);
    else Insert(rs(p),id,v);
    tree[p].sum=tree[ls(p)].sum+tree[rs(p)].sum;
}
int query(int p,int L,int R){
    if(L>R)return 0;
    int l=tree[p].l,r=tree[p].r,mid=(l+r)>>1;
    if(L<=l&&r<=R)return tree[p].sum;
    if(L<=mid&&mid<R)return query(ls(p),L,R)+query(rs(p),L,R);
    if(L<=mid)return query(ls(p),L,R);
    return query(rs(p),L,R);
}

int main(){
    scanf("%s",s+1);
    n=strlen(s+1);
    for(int i=1;i<=n;++i){
        if(s[i]==')')continue;
        if(s[i]=='(')pl[i]++;
        if(s[i-1]=='(')pl[i]+=pl[i-1];
    }
    for(int i=n;i;i--){
        if(s[i]=='(')continue;
        if(s[i]==')')pr[i]++;
        if(s[i+1]==')')pr[i]+=pr[i+1];
    }
    build(1,1,n);
    for(int i=1;i<=n;++i){
        if(pl[i]&&pr[i+1])is.push_back(i),Insert(1,i,2*min(pl[i],pr[i+1]));
    }
    scanf("%d",&q);
    while(q--){
        int l,r;scanf("%d%d",&l,&r);
        int p1=lower_bound(is.begin(),is.end(),l)-is.begin(),p2=upper_bound(is.begin(),is.end(),r)-is.begin()-1;
        if(p1>p2){
            puts("0");continue;
        }int ans1=0,ans2=0,ans3=0;
        int a=is[p1],b=is[p2];
        if(p1==p2){
            ans1=min(min(a-l+1,pl[a]),min(r-a,pr[a+1]))*2;
            printf("%d\n",ans1);continue;
        }
        ans1=min(min(a-l+1,pl[a]),min(r-a,pr[a+1]))*2;
        ans2=min(min(b-l+1,pl[b]),min(r-b,pr[b+1]))*2;
        ans3=query(1,a+1,b-1);
        printf("%d\n",ans1+ans2+ans3);
    }
    return 0;
}