/*#include<bits/stdc++.h>
using namespace std;
int a[1000005];
int ll[1000005],rr[1000005];
int ll1[1000005],rr1[1000005];
stack<int> st;
int main(){
    string s;
    cin>>s;
    int cnt=0;
    for(int i=0;i<s.size();i++){
        if(s[i]=='('){
            cnt++;
            st.push(i+1);
        }
        else if(cnt){
            cnt--;
            ll1[st.top()]=i+1;
            st.pop();
            ll[i+1]+=2;
        }
        ll[i+1]+=ll[i];
    }
    while(st.size()){
        st.pop();
    }
    cnt=0;
    for(int i=s.size()-1;i>=0;i--){
        if(s[i]==')'){
            cnt++;
            st.push(i+1);
        }
        else if(cnt){
            cnt--;
            rr1[st.top()]=i+1;
            st.pop();
            rr[i+1]+=2;
        }
        rr[i+1]+=rr[i+2];
    }
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        int l,r,ans=0;
        scanf("%d%d",&l,&r);
        ans=ll[s.size()]-ll[l-1]-rr[r+1];
        if(l!=1){
            if((s[l-2]=='('&&(ll1[l-1]>=l&&ll1[l-1]<=r))||(s[l-1]==')'&&rr1[l]))ans-=2;
        }
        if(r!=s.size()){
            if((s[r]==')'&&(rr1[r+1]>=l&&rr1[r+1]<=r))||(s[r-1]=='('&&ll1[r]))ans-=2;
        }
        if(l!=1&&r!=s.size()&&s[l-2]=='('&&ll1[l-1]==r+1)ans-=2;
        printf("%d\n",ans);
    }
}*/
//#pragma GCC optimize(2)
//#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const int N=1e6+5;
const ll mod=1e9+7;
const double eps=1e-5;
//const double pi=acos(-1);
 
#define ls p<<1
#define rs p<<1|1
 
char s[N];
struct seg{
    int l,r,mx;
}t[N<<2];
void build(int p,int l,int r){
    if(l==r){
        t[p].l=s[l]=='(';
        t[p].r=s[l]==')';
        return;
    }
    int mid=l+r>>1;
    build(ls,l,mid);
    build(rs,mid+1,r);
    int x=min(t[ls].l,t[rs].r);
    t[p].mx=t[ls].mx+x+t[rs].mx;
    t[p].l=t[ls].l-x+t[rs].l;
    t[p].r=t[ls].r+t[rs].r-x;
}
seg ask(int p,int l,int r,int x,int y)
{
    if(x<=l&&r<=y)
        return t[p];
    int mid=l+r>>1;
    if(y<=mid)
        return ask(ls,l,mid,x,y);
    else if(x>mid)
        return ask(rs,mid+1,r,x,y);
    else
    {
        seg ans;
        seg lx=ask(ls,l,mid,x,y);
        seg rx=ask(rs,mid+1,r,x,y);
        int use=min(lx.l,rx.r);
        ans.mx=lx.mx+rx.mx+use;
        ans.l=lx.l+rx.l-use;
        ans.r=lx.r+rx.r-use;
        return ans;
    }
}
int main() {
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    int n,m;
    cin>>(s+1);
    cin>>m;
    n=strlen(s+1);
    build(1,1,n);
    while(m--)
    {
        int l,r;
        cin>>l>>r;
        printf("%d\n",ask(1,1,n,l,r).mx*2);
    }
    return 0;
}