#include<bits/stdc++.h>
#define ll long long
#define db double
#define ull unsigned long long
#define pb push_back
#define pii pair<int, int>
#define FR first
#define SE second
#define int long long
using namespace std;
inline int read() {
  int x = 0; bool op = false;
  char c = getchar();
  while(!isdigit(c))op |= (c == '-'), c = getchar();
  while(isdigit(c))x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  return op ? -x : x;
}
const int N = 2e5 + 10;
int n, Q, m;
char s[N];
int st[N][25], f[N];
void build() {
  m = 0;
  for(int i = 0; i < n; i++)if(s[i] == '(')f[m++] = i;
  for(int i = 0; i < m; i++)f[i + m] = f[i] + n;
  // for(int i = 0; i < m * 2; i++)printf("%d ", f[i]); putchar('\n');
  for(int i = 0; i < m * 2; i++)f[i] -= i * 2;
  for(int i = 0; i < m * 2; i++)st[i][0] = f[i];
  for(int j = 1; (1 << j) <= m * 2; j++)
    for(int i = 0; i + (1 << j) - 1 < m * 2; i++)
      st[i][j] = min(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
  return ;
}
int query(int l, int r) {
  int t = __lg(r - l + 1);
  return min(st[l][t], st[r - (1 << t) + 1][t]);
}
int kth(int t, int k) {
  int val = t + 2 * k;
  if(t >= m) {
    if(m * 2 <= n)t = m - 1;
    else k = k + t - m + 1, t = m - 1;
  }
  int p = k / m; k %= m;
  // cout << "qry:" << t << ' ' << k << ' ' << p << endl;
  if(k < 0)p--, k += m;
  return query(k, k + t) + (n - m * 2) * p + val;
}
int calc(int t, int r) {
  int lef = -3e9, rig = 3e9;
  while(lef + 1 < rig) {
    int mid = lef + rig >> 1;
    if(kth(t, mid) <= r)lef = mid;
    else rig = mid;
  }
  // cout << t << ' ' << r << ' ' << lef << endl;
  return lef;
}
void solve() {
  scanf("%s", s);
  n = strlen(s);
  build();
  Q = read();
  while(Q--) {
    int t = read(), l = read(), r = read();
    printf("%lld\n", (m == 0 ? 0 : calc(t, r) - calc(t, l - 1)));
  } 
  return ;
}
signed main() {
  int test = read();
  while(test--)solve();
  return 0;
}