#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll inf = 1e12;
int n, m, f[200010][20], lg[200010];
char a[100010];
int qmd(int x, int m){ x = x % m + m; return x >= m ? x - m : x; }
int qry(int l, int r){ int i = lg[r - l + 1]; return min(f[l][i], f[r - (1 << i) + 1][i]); }
ll calc(int k, int x){
	int i;
	if(k <= m || n >= m << 1){
		i = qmd(x, m);
		return qry(i, i + min(k, m - 1)) + ((ll)x - i) / m * (n - (m << 1)) + (x << 1) + k;
	}else{
		i = qmd(x + k - m + 1, m);
		return qry(i, i + m - 1) + ((ll)x + k - m + 1 - i) / m * (n - (m << 1)) + (x << 1) + k;
	}
}
int g(int k, int x){
	int l = min(x - k, (x - k) / n) - n, r = max(x, x / n) + n, md;
	while(l < r){
		md = (l + r + 1 + (inf << 1) >> 1) - inf;
		if(calc(k, md) <= x) l = md;
		else r = md - 1;
	}
	return l;
}
void solve(){
	int q, i, j, k, l, r;
	memset(a, '\0', sizeof(a));
	scanf(" %s", a);
	for(i = 0; a[i] != '\0'; i++) ;
	n = i; lg[0] = -1;
	for(i = 0, m = 0; i < n; i++){
		if(a[i] == '('){ f[m][0] = i - (m << 1); m++; lg[m] = lg[m >> 1] + 1; }
	}
	if(m == 0){
		scanf("%d", &q);
		while(q--){ scanf("%d%d%d", &k, &l, &r); printf("0\n"); }
		return;
	}
	for(i = 0; i < m; i++) f[i + m][0] = f[i][0] + n - (m << 1);
	for(i = (m << 1) - 1; i >= 0; i--){
		for(j = 1; i + (1 << j) <= m << 1; j++) f[i][j] = min(f[i][j - 1], f[i + (1 << j - 1)][j - 1]);
	}
	scanf("%d", &q);
	while(q--){
		scanf("%d%d%d", &k, &l, &r);
		printf("%d\n", g(k, r) - g(k, l - 1));
	}
}
int main()
{
	int t;
	scanf("%d", &t);
	while(t--) solve();
	return 0;
}