#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 1000010
#define mid (l+r>>1)
using namespace std;
char c[N];
int n,m,s[N],w[N],t=0,l[N],r[N],v[N],a[N],b[N<<2];
void build(int l,int r,int x){
    if(l==r){ b[x]=a[l]; return; }
    build(l,mid,x<<1);
    build(mid+1,r,x<<1|1);
    b[x]=min(b[x<<1],b[x<<1|1]);
}
inline int query(int l,int r,int x,int L,int R){
    if(L<=l && r<=R) return b[x];
    int ans=n;
    if(L<=mid) ans=min(ans,query(l,mid,x<<1,L,R));
    if(mid<R) ans=min(ans,query(mid+1,r,x<<1|1,L,R));
    return ans;
}
int main(){
    scanf("%s%d",c+1,&m); n=strlen(c+1);
    for(int i=1;i<=n;++i){
        if(!t && c[i]==')') v[i]=1;
        else if(c[i]=='(') w[++t]=i;
        else {
            s[i]=w[t]; s[w[t]]=i;
            ++l[w[t]+1]; --l[i+1];
            ++r[w[t]]; --r[i];
            ++a[w[t]]; --a[i+1];
            --t;
        }
    }
    for(;t;--t) v[w[t]]=1;
    for(int i=1;i<=n;++i){
        a[i]+=a[i-1];
        r[i]+=r[i-1]; l[i]+=l[i-1];
    }
    for(int i=1;i<=n;++i) a[i]-=!v[i],v[i]+=v[i-1];
    build(1,n,1);
    for(int x,y;m--;){
        scanf("%d%d",&x,&y);
        printf("%d\n",max(0,y-x+1-(v[y]-v[x-1])-r[y]-l[x]+query(1,n,1,x,y)*2));
    }
}