#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
const int maxn = 100000;
int n, c;
char str[maxn + 5];
int f0[2 * maxn + 5][20];
int lg2[2 * maxn + 5];
inline int qMin(int l, int r) {
	int t = lg2[r - l + 1];
	return min(f0[l][t], f0[r - (1 << t) + 1][t]);
}
inline int f(int i, int t) {
	int l, r; 
	if (n - 2 * c > 0) l = i, r = i + min(t, c - 1);
	else r = i + t, l = max(i, r - c + 1); 
	int id = (l - 1) / c;
	l -= id * c, r -= id * c;
	return qMin(l, r) + id * (n - 2 * c) + t + 2 * i;
}
inline i64 q(i64 x, int k) {
	int fir = f(1, k);
	i64 rs = (x - fir) / n * c;
	x = (x - fir) % n + fir;
	int l = 0, r = c;
	while (l < r) {
		int mid = (l + r + 1) / 2;
		if (f(mid, k) <= x) l = mid;
		else r = mid - 1;
	}
	return rs + l;
}
int main() {
	int T;
	scanf("%d", &T);
	while (T--) {
		scanf("%s", str);
		n = strlen(str), c = 0;
		for (int i = 0; i < n; i++)
			if (str[i] == '(') f0[++c][0] = i;
		for (int i = 1; i <= c; i++) f0[i][0] -= 2 * i;
		for (int i = 1; i <= c; i++) f0[i + c][0] = f0[i][0] + n - 2 * c;
		for (int i = 2 * c; i; i--)
			for (int j = 1; i + (1 << j) - 1 <= 2 * c; j++) f0[i][j] = min(f0[i][j - 1], f0[i + (1 << (j - 1))][j - 1]);
		for (int i = 2; i <= 2 * c; i++) lg2[i] = lg2[i >> 1] + 1;
		int Q;
		scanf("%d", &Q);
		for (int i = 1; i <= Q; i++) {
			i64 l, r; int k;
			scanf("%d%lld%lld", &k, &l, &r);
			l += 2000000000LL * n, r += 2000000000LL * n;
			printf("%lld\n", q(r, k) - q(l - 1, k));
		}
	}
}