#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define sz(a) ((int) a.size())
#define vi vector<int>
#define ll long long
#define me(f, x) memset(f, x, sizeof(f))  
#define ull unsigned long long 
using namespace std;
const int N = 3e5 + 7;
int n, q;
char s[N];
int pre[N];
inline ll pres(ll x) {
	return pre[x % n] + x / n * pre[n - 1];
}
inline int SUM(ll l, ll r) {
	if(l <= 0) {
		ll dv = (-l + n) / n;
		l += dv * n;
		r += dv * n;
	}
	return pres(r) - pres(l - 1);
}
template < int N > struct RMQ {
	int a[N], mx[20][N], lg[N];
	void init (int n) {
		L(i, 2, n) lg[i] = lg[i >> 1] + 1;
		L(i, 1, n) mx[0][i] = i;
		L(i, 1, 19)
			L(j, 1, n - (1 << i) + 1) 
				mx[i][j] = a[mx[i - 1][j]] > 
				a[mx[i - 1][j + (1 << (i - 1))]] ? mx[i - 1][j] : 
				mx[i - 1][j + (1 << (i - 1))];
	}
	int queryp (int l, int r) {
		int p = lg[r - l + 1];
		return a[mx[p][l]] < a[mx[p][r - (1 << p) + 1]] ? mx[p][r - (1 << p) + 1] : mx[p][l];
	}
	int query (int l, int r) { return a[queryp (l, r)]; }
} ;
RMQ < N > A[2]; 
inline int calc(int p, int k) {
	int ret = -1e9, cur = SUM(p - k + 1, p);
	p -= k;
	p = (p % n + n) % n;
	int len = min(k * 2, n - 1);
	ret = A[p & 1].query(p + 1, p + len + 1) + p / 2;
	return max(-ret + cur + pre[p], 0);
}
void Main() {
	cin >> s;
	n = strlen(s);
	L(i, 0, n - 1) {
		if(s[i] == '(') {
			s[i] = '0';
		} else {
			s[i] = '1';
		}
	}
	int cnt = 0, opr = 0;
	L(i, 0, n - 1) {
		if(s[i] == '0') {
			++cnt;
		} else {
			--cnt; 
		}
	}
	if(cnt > 0) {
		opr = 1;
		L(i, 0, n - 1) {
			s[i] ^= 1;
		}
		reverse(s + 1, s + n);
	}
	L(i, n, n * 2 - 1) 
		s[i] = s[i - n];
	L(i, 0, n * 2 - 1) 
		pre[i] = s[i] == '0';
	L(i, 1, n * 2 - 1) 
		pre[i] += pre[i - 1];
	L(o, 0, 1) {
		L(i, 1, n * 2) {
			A[o].a[i] = pre[i - 1] - (i - o) / 2;
		}
		A[o].init(n * 2);
	} 
	cin >> q;
	while(q--) {
		int l, r, k;
		cin >> k >> l >> r;
		if(opr) {
			l = -l;
			r = -r;
			swap(l, r);
		}
		ll ans = SUM(l, r);
		ans += calc(l - 1, k) - calc(r, k);
		if(opr) {
			ans = r - l + 1 - ans;
		}
		cout << ans << '\n';
	}
}
int main() {
	ios :: sync_with_stdio (false);
	cin.tie (0); cout.tie (0);
	int t; cin >> t; while(t--) Main();
	return 0;
}