#include<bits/stdc++.h>
using namespace std;
namespace my_IO{
    #define ll long long
    #define ull unsigned long long
    #define ld long double
    #define spc putchar(' ')
    #define et putchar('\n')
    template<class T>
    void read(T &num){
        T x=0,f=1;
        char c=getchar();
        while(!isdigit(c)){
            if(c=='-') f=-1;
            c=getchar();
        }
        while(isdigit(c)){
            x=(x<<3)+(x<<1)+c-48;
            c=getchar();
        }
        num=f*x;
    }
    template<class T>
    void write(T x){
        static char buf[40];
        static int len=-1;
        if(x<0) putchar('-'),x=-x;
        do{
            buf[++len]=x%10+48;
            x/=10;
        }while(x);
        while(len>=0) putchar(buf[len--]);
    }
}
using namespace my_IO;
const int inf=1e9;
const int maxn=1e5+10;
int n,m,F[maxn<<1][20],lg[maxn<<1];
char s[maxn];
int query(int l,int r){
    // cout<<l<<" "<<r<<"\n";
    int k=lg[r-l+1];
    return min(F[l][k],F[r-(1<<k)+1][k]);
}
int que(int l,int r){
    // cout<<l<<" "<<r<<"\n";
    int k=l/m;
    int nl=l%m,nr=nl+r-l,res=(n-2*m)*k;
    if(nl<0) nl+=m,nr+=m,res-=n-2*m;
    // cout<<nl<<" "<<nr<<" "<<res<<"\n";
    return query(nl,nr)+res;
}
int f(int k,int i){
    // cout<<k<<" "<<i<<":\n";
    if(k<=m) return que(i,i+k)+2*i+k;
    if(n>=2*m) return que(i,i+m-1)+2*i+k;
    return que(i+k-m+1,i+k)+2*i+k;
}
int g(int k,int p){
    // cout<<k<<" "<<p<<"\n";
    int l=-inf,r=inf,res=0;
    while(l<=r){
        int mid=(l+r)>>1;
        // cout<<mid<<":\n";
        if(f(k,mid)<=p){
            // cout<<"yes\n";
            res=mid;
            l=mid+1;
        }
        else r=mid-1;
    }
    // cout<<res<<"\n";
    return res;
}
void solve(){
    memset(F,0x3f,sizeof(F));
    scanf("%s",s);
    n=strlen(s);
    int cnt=-1;
    for(int i=0;i<n;i++){
        if(s[i]=='('){
            cnt++;
            F[cnt][0]=i-2*cnt;
        }
    }
    m=cnt+1;
    for(int i=0;i<m;i++) F[i+m][0]=F[i][0]+n-2*m;
    for(int j=1;j<=19;j++) for(int i=0;i+(1<<j)-1<=2*m-1;i++) F[i][j]=min(F[i][j-1],F[i+(1<<(j-1))][j-1]);
    int q;
    read(q);
    while(q--){
        int l,r,k;
        read(k),read(l),read(r);
        write(g(k,r)-g(k,l-1)),et;
    }
}
int main(){
    for(int i=2;i<maxn<<1;i++) lg[i]=lg[i>>1]+1;
    int t=1;
    read(t);
    while(t--) solve();
}