#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define ll long long
#define ls p<<1
#define rs p<<1|1
using namespace std;
const int MN=1e6+5;
ll n,q;
struct tree{
    ll lsum,rsum,l,r;
    void clear(){lsum=rsum=0;}
}t[MN<<2];
char ch[MN];
void write(ll n){if(n<0){putchar('-');write(-n);return;}if(n>9)write(n/10);putchar(n%10+'0');}
ll read(){ll x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
void update(ll p){
    ll num=min(t[ls].lsum,t[rs].rsum);
    t[p].lsum=t[ls].lsum+t[rs].lsum-num;
    t[p].rsum=t[ls].rsum+t[rs].rsum-num;
}
void build(ll p, ll l, ll r){
    t[p].l=l;t[p].r=r;
    if(l==r){
        if(ch[l]=='(') t[p].lsum=1;
        else t[p].rsum=1;
        return;
    }
    ll mid=l+r>>1;
    build(ls,l,mid);build(rs,mid+1,r);
    update(p);
}
tree query(ll p, ll l, ll r){
    if(l<=t[p].l&&t[p].r<=r) return t[p];
    ll mid=(t[p].l+t[p].r)>>1;tree res;res.clear();
    if(r<=mid) return query(ls,l,r);
    if(l>mid) return query(rs,l,r);
    tree lc=query(ls,l,r),rc=query(rs,l,r);
    ll num=min(lc.lsum,rc.rsum);
    res.lsum=lc.lsum+rc.lsum-num;
    res.rsum=lc.rsum+rc.rsum-num;
    return res;
}
int main(){
    scanf("%s",ch+1);n=strlen(ch+1);
    build(1,1,n);
    q=read();while(q--){
        ll l=read(),r=read();
        tree ans=query(1,l,r);
        write((r-l+1)-ans.lsum-ans.rsum);putchar('\n');
    }
    return 0;
}