#include <cstdio>
#include <algorithm>
#include <cstring>

#pragma GCC optimize(3)

const int maxn = 100000;
const int maxlog = 17;
int sl;
char s[maxn + 10];

int n;
int log_2[maxn + 10];
int st[maxlog + 1][maxn + 10];
int query_st(int l, int r){
	int len = r - l + 1;
	int lg = log_2[len];
	return std::min(st[lg][l], st[lg][r - (1 << lg) + 1]);
}

int read_int(){
	char c;
	while(((c = getchar()) < '0' || c > '9') && c != '-');
	bool flag = false;
	int x = 0;
	if(c == '-'){
		flag = true;
	}
	else{
		x = c - '0';
	}
	while((c = getchar()) >= '0' && c <= '9'){
		x = x * 10 + c - '0';
	}
	if(flag)
		return -x;
	return x;
}

int read_string(char *sp){
	char c;
	while((c = getchar()) != '(' && c != ')');
	sp[0] = c;
	int p = 1;
	while((c = getchar()) == '(' || c == ')'){
		sp[p] = c;
		++p;
	}
	sp[p] = '\0';
	return p;
}

long long get_p(int k, long long i){
	//左端点所在段号 
	long long t1 = 0;
	if(i < 0){
		t1 = (i - (n - 1)) / n;
	}
	else{
		t1 = i / n;
	}
	//右端点所在段号
	long long t2 = 0;
	if(i + k < 0){
		t2 = (i + k - (n - 1)) / n;
	}
	else{
		t2 = (i + k) / n;
	}
	//答案的一部分 
	long long ans;
	//左右端点
	int l = (i % n + n) % n;
	int r = ((i + k) % n + n) % n;
	if(sl > 2 * n){
		if(k + 1 > n){
			if(l == 0){
				ans = query_st(l, n - 1) - 2 * t1 * n + t1 * sl;
			}
			else{
				ans = std::min(query_st(l, n - 1) - 2 * t1 * n + t1 * sl, query_st(0, l - 1) - 2 * (t1 + 1) * n + (t1 + 1) * sl);
			}
		}
		else{
			if(r < l){
				ans = std::min(query_st(0, r) - 2 * t2 * n + t2 * sl, query_st(l, n - 1) - 2 * t1 * n + t1 * sl);
			}
			else if(l < r){
				ans = query_st(l, r) - 2 * t1 * n + t1 * sl;
			}
			else{
				if(k == 0){
					ans = query_st(l, r) - 2 * t1 * n + t1 * sl;
				}
				else{
					ans = std::min(query_st(0, r) - 2 * t2 * n + t2 * sl, query_st(l, n - 1) - 2 * t1 * n + t1 * sl);
				}
			}
		}
	}
	else{
		if(k + 1 > n){
			if(r == n - 1){
				ans = query_st(0, r) - 2 * t2 * n + t2 * sl;
			}
			else{
				ans = std::min(query_st(0, r) - 2 * t2 * n + t2 * sl, query_st(r + 1, n - 1) - 2 * (t2 - 1) * n + (t2 - 1) * sl);
			}
		}
		else{
			if(r < l){
				ans = std::min(query_st(0, r) - 2 * t2 * n + t2 * sl, query_st(l, n - 1) - 2 * t1 * n + t1 * sl);
			}
			else if(l < r){
				ans = query_st(l, r) - 2 * t1 * n + t1 * sl;
			}
			else{
				if(k == 0){
					ans = query_st(l, r) - 2 * t1 * n + t1 * sl;
				}
				else{
					ans = std::min(query_st(0, r) - 2 * t2 * n + t2 * sl, query_st(l, n - 1) - 2 * t1 * n + t1 * sl);
				}
			}
		}
	}
	return ans + 2 * i + k;
}

int main(){
	log_2[1] = 0;
	for(int i = 2; i <= maxn; ++i){
		log_2[i] = log_2[(i >> 1)] + 1;
	}
	
	int T;
	T = read_int();
	while(T--){
		sl = read_string(s);
		n = 0;
		for(int i = 0; i < sl; ++i){
			if(s[i] == '('){
				st[0][n] = i - 2 * n;
				++n;
			}
		}
		
		for(int i = 1; i <= log_2[n]; ++i){
			int t = (1 << (i - 1));
			int t2 = (1 << i);
			for(int j = 0; j + t2 - 1 < n; ++j){
				st[i][j] = std::min(st[i - 1][j], st[i - 1][j + t]);
//				printf("%d,%d:%d\n", i, j, st[i][j]);
			}
		}
		/*for(int j = 3; j <= 100; ++j){
			printf("---%d---\n", j);
			for(int i = -2; i <= 10; ++i){
				printf("*%d,%lld\n", i, get_p(j, i));
			}
		}*/
		int q;
		int k, rl, rr;
		q = read_int();
		if(n == 0){
			while(q--){
				k = read_int();
				rl = read_int();
				rr = read_int();
				printf("0\n");
			}
		}
		else{
			while(q--){
				k = read_int();
				rl = read_int();
				rr = read_int();
				long long l = -5e9, r = 5e9;
				while(l != r){
					long long mid = (l + r) >> 1;
					if(get_p(k, mid) < rl)
						l = mid + 1;
					else
						r = mid;
				}
				int ansl = l;
				l = -5e9;
				r = 5e9;
				while(l != r){
					long long mid = (l + r + 1) >> 1;
					if(get_p(k, mid) <= rr)
						l = mid;
					else
						r = mid - 1;
				}
				printf("%lld\n", l - ansl + 1);
			}
		}
		
	}
	return 0;
}

/*
4
))()(
3
3 -4 -1
0 -3 4
2 1 3
(())
3
0 -3 2
1 -2 3
2 0 0
))()(()(
4
1234 -5678 9012
123 -456 789
12 -34 56
1 -2 3
)))))
5
1 2 3
1 2 3
1 2 3
1 2 3
1 2 3
*/