#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;
    
    int n = s.size();
    
    std::fill(fen, fen + n, 0);
    
    int q;
    std::cin >> q;
    
    std::vector<std::array<int, 4>> qry(q);
    for (int i = 0; i < q; i++) {
        int k, l, r;
        std::cin >> k >> l >> r;
        r++;
        qry[i] = {k, l, r, i};
    }
    std::vector<int> ans(q);
    std::sort(qry.begin(), qry.end());
    
    std::set<int> p;
    auto check = [&](int i) {
        if (s[i] == '(' && s[(i - 1 + n) % n] != s[(i + 1) % n]) {
            p.insert(i);
        }
    };
    for (int i = 0; i < n; i++) {
        check(i);
    }
    int cur = 0;
    for (int i = 0; i < n; i++) {
        if (s[i] == '(') {
            add(i, 1);
        }
    }
    auto get = [&](int x) {
        int v = x / n;
        if (x - v * n < 0) {
            v -= 1;
        }
        int ans = sum(n) * v;
        x -= v * n;
        ans += sum(x);
        return ans;
    };
    for (auto [k, l, r, i] : qry) {
        while (cur < k && !p.empty()) {
            std::vector<int> v(p.begin(), p.end());
            for (auto j : v) {
                j = (j - 1 + n) % n;
                if (s[j] == '(') {
                    add(j, -1);
                    s[j] = ')';
                } else {
                    add(j, 1);
                    s[j] = '(';
                }
            }
            p.clear();
            for (auto j : v) {
                check((j - 2 + n) % n);
                check((j - 1 + n) % n);
                check(j);
            }
            cur++;
        }
        l -= k;
        r -= k;
        ans[i] = get(r) - get(l);
    }
    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;
}