#include<bits/stdc++.h>
#define ll long long
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=1e5,inf=1e9+7;

int n,m,q; char s[Maxn+5];
int rk[Maxn+5],st[Maxn+5][20];

inline int Count(int l,int r)
{
    int len=__lg(r-l+1);
    return min(st[l][len],st[r-(1<<len)+1][len]);
}
inline ll Find(int k,int x)
{
    int p=(x%m+m)%m,r=min(m-1,p+k);
    ll res=Count(p,r)+1ll*n*((x-p)/m)+2*p;
    // printf("%d %d: %d %d: %lld\n",k,x,p,r,res);
    if(p+k>=m)
    {
        r=min(m-1,p+k-m);
        res=min(res,Count(0,r)+1ll*n*((x-p)/m+1)-2*(m-p));
    } return res+k;
}
inline int Get(int k,int x)
{
    int l=-inf,r=inf;
    while(l<r)
    {
        int mid=l+(r-l+1)/2;
        if(Find(k,mid)<=x) l=mid; else r=mid-1;
    } return l;
}
inline void Solve()
{
    scanf("%s%d",s,&q),n=strlen(s); int flg=0;
    m=0; For(i,0,n-1) if(s[i]=='(') rk[m++]=i;
    if(!m) {while(q--) {int k,l,r; cin>>k>>l>>r; puts("0");} return;}
    if(m==n) {while(q--) {int k,l,r; cin>>l>>l>>r; printf("%d\n",r-l+1);} return;}
    if(m>n/2)
    {
        reverse(s,s+n),m=0,flg=1;
        For(i,0,n-1) if(s[i]==')') rk[m++]=i;
    }
    For(i,0,m-1) st[i][0]=rk[i]-2*i;
    For(j,1,19) for(int i=0;i+(1<<j)<=m;++i)
        st[i][j]=min(st[i][j-1],st[i+(1<<j-1)][j-1]);
    while(q--)
    {
        int k,l,r; cin>>k>>l>>r;
        if(flg) swap(l,r),l=n-1-l,r=n-1-r;
        int b=Get(k,r),a=Get(k,l-1);
        if(!flg) printf("%d\n",b-a);
        else printf("%d\n",r-l+1-(b-a));
    }    
}

int main()
{
    // freopen("1.in","r",stdin);

    int T; cin>>T;
    while(T--) Solve();    
    return 0;
}