#include<bits/stdc++.h>
#define I using
#define love namespace
#define Elaina std
#define ll long long
I love Elaina;
const int N=100010;
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<<3)+(x<<1)+ch-'0';
		ch=getchar();
	}
	return x*f;
}
ll T,n,m,k,x,y,z,st[N<<1][20],lg[N<<1];
char str[N];
vector<int>pos;
ll query(int ql,int qr){
	int k=lg[qr-ql+1];
	return min(st[ql][k],st[qr-(1<<k)+1][k]);
}
ll calcf(ll x,ll y){
	ll l,r,L;
	if(n>=2*k)l=y,r=min(x+y,y+k-1);
	else l=max(y,x+y-k+1),r=x+y;
	L=(l%k+k)%k;
	return query(L,L+r-l)+(l-L)/k*(n-2*k)+2*y+x;
}
ll calcg(ll x,ll y){
	ll l=-2e9,r=2e9,res=-2e9;
	while(l<=r){
		ll mid=(l+r)/2;
		if(calcf(x,mid)<=y)res=mid,l=mid+1;
		else r=mid-1;
	}
	return res;
}
int main(){
	lg[0]=-1;
	for(int i=1;i<=200000;i++)lg[i]=lg[i>>1]+1;
	T=read();
	while(T--){
		pos.clear();
		scanf("%s",str);
		n=strlen(str),m=read();
		for(int i=0;i<n;i++)if(str[i]=='(')pos.push_back(i);
		k=pos.size();
		for(int i=0;i<k;i++)st[i][0]=pos[i];
		for(int i=k;i<2*k;i++)st[i][0]=st[i-k][0]+n;
		for(int i=0;i<2*k;i++)st[i][0]-=2*i;
		for(int j=1;j<20;j++)for(int i=0;i<2*k-(1<<j)+1;i++)st[i][j]=min(st[i][j-1],st[i+(1<<(j-1))][j-1]);
		while(m--){
			x=read(),y=read(),z=read();
			if(k)printf("%lld\n",calcg(x,z)-calcg(x,y-1));
			else puts("0");
		}
	}
	return 0;
}