#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int N=1e5+3;
int T,m,n,q,lg[N],st[20][N<<1];
char s[N];

int read(){
  int x=0,f=1;char ch=getchar();
  while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
  while(isdigit(ch)){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
  return x*f;
}

void print(ll x){
  int p[25],tmp=0;
  if(x==0) putchar('0');
  if(x<0) putchar('-'),x=-x;
  while(x) p[++tmp]=x%10,x/=10;
  for(int i=tmp;i>=1;i--) putchar(p[i]+'0');
  putchar('\n');
}

void init(){
  m=0;
  for(int i=0;i<n;i++) if(s[i]=='(') st[0][m++]=i;
  for(int i=m;i<m*2;i++) st[0][i]=st[0][i-m]+n;
  for(int i=0;i<m*2;i++) st[0][i]-=i*2; 
  for(int i=1;i<20;i++)
    for(int j=0;j+(1<<i)-1<m*2;j++)
      st[i][j]=min(st[i-1][j],st[i-1][j+(1<<(i-1))]);
}

ll calc(ll k,ll i){
  ll L,R;
  if(m*2<=n) L=i,R=min(i+k,L+m-1);
  else R=i+k,L=max(R-m+1,i);
  ll div=(L>=0?L/m:(L+1)/m-1),delta=1ll*n*div-2ll*m*div;
  int len=R-L+1,p=lg[len],nw=(L%m+m)%m;
  return min(st[p][nw],st[p][nw+len-(1<<p)])+delta+k+2*i;
}

ll query(ll k,ll x){
  ll l=-3e9,r=3e9;
  while(l<r){
  	ll mid=(l+r+1)/2;
  	if(calc(k,mid)<=x) l=mid;
  	else r=mid-1;
  }
  return l;
}

void sol(){
  scanf("%s",s); 
  n=strlen(s);init();
  q=read();
  for(int i=1;i<=q;i++){
    ll k=1ll*read(),l=1ll*read(),r=1ll*read();
    if(m==0) puts("0");
    else print(query(k,r)-query(k,l-1));
  }
}

int main(){
  lg[1]=0;
  for(int i=2;i<N;i++) lg[i]=lg[i>>1]+1;
  T=read();
  while(T--) sol();
  return 0;
}