#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 1E5;

int fen[N];

void add(int x, int y) {
    for (int i = x + 1; i <= N; i += i & -i) {
        fen[i - 1] += y;
    }
}

int sum(int x) {
    int ans = 0;
    for (int i = x; i; i &= i - 1) {
        ans += fen[i - 1];
    }
    return ans;
}

void solve() {
    std::string s;
    std::cin >> s;
    // std::mt19937 rng;
    // for (int i = 0; i < 100000; i++) {
    //     s += (rng() % 2 ? ')' : '(');
    // }
    
    int n = s.size();
    
    int cnt = std::count(s.begin(), s.end(), '(');
    // std::cerr << "cnt : " << cnt << "\n";
    bool rev = false;
    if (cnt > n / 2) {
        rev = true;
        std::reverse(s.begin() + 1, s.end());
        for (auto &c : s) {
            c ^= '(' ^ ')';
        }
    }
    
    std::fill(fen, fen + n, 0);
    
    int q;
    std::cin >> q;
    
    std::vector<std::array<i64, 4>> qry(q);
    for (int i = 0; i < q; i++) {
        int k, l, r;
        std::cin >> k >> l >> r;
        if (rev) {
            l *= -1;
            r *= -1;
            std::swap(l, r);
        }
        r++;
        qry[i] = {k, l, r, i};
    }
    std::vector<int> ans(q);
    std::sort(qry.begin(), qry.end());
    std::vector<int> pre(n + 1);
    for (int i = 0; i < n; i++) {
        pre[i + 1] = pre[i] + (s[i] == '(' ? 1 : -1);
    }
    int b = std::max_element(pre.begin(), pre.end()) - pre.begin();
    std::rotate(s.begin(), s.begin() + b, s.end());
    
    std::vector<int> pos;
    for (int i = n - 1; i >= 0; i--) {
        if (s[i] == '(') {
            pos.push_back(i + 2 * pos.size());
        }
    }
    const int C = pos.size();
    std::vector<int> L(C, -1), R(C, C);
    std::vector<int> stk;
    for (int i = 0; i < C; i++) {
        while (!stk.empty() && pos[i] < pos[stk.back()]) {
            R[stk.back()] = i;
            stk.pop_back();
        }
        L[i] = stk.empty() ? -1 : stk.back();
        stk.push_back(i);
    }
    auto get = [&](i64 x, i64 k) {
        i64 v = x / n;
        if (x - v * n < 0) {
            v -= 1;
        }
        i64 ans = 1LL * C * v;
        x -= v * n;
        // ans += sum(x);
        for (int i = 0; i < C; i++) {
            int v = pos[i];
            for (int j = std::max(0LL, i - k); j <= i; j++) {
                v = std::min(v, pos[j]);
            }
            v -= 2 * i;
            ans += (v < x);
        }
        return ans;
    };
    for (auto [k, l, r, i] : qry) {
        l -= k;
        r -= k;
        l -= b;
        r -= b;
        ans[i] = get(r, k) - get(l, k);
        if (rev) {
            ans[i] = r - l - ans[i];
        }
    }
    for (int i = 0; i < q; i++) {
        std::cout << ans[i] << "\n";
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}