#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
struct node {
    long long l, r, ans;
    node() : l(0), r(0), ans(0) {}
    node(char s) : l(s == ')'), r(s == '('), ans(0) {}
    node(long long l, long long r, long long ans) : l(l), r(r), ans(ans) {}
};
node merge(node a, node b) {
    long long newans = min(a.r, b.l);
    return node(a.l + b.l - newans, a.r + b.r - newans, a.ans + b.ans + 2 * newans);
}
struct segmenttree {
    char s[1000010];
    node val[4000010];
    void pushup(int p) {
        val[p] = merge(val[p << 1], val[p << 1 | 1]);
    }
    void build(int p, int l, int r) {
        if (l == r) {
            val[p] = node(s[l]);
            return;
        }
        int mid = (l + r) >> 1;
        build(p << 1, l, mid);
        build(p << 1 | 1, mid + 1, r);
        pushup(p);
        // printf("%d %d %d : %lld %lld %lld\n", p, l, r, val[p].l, val[p].r, val[p].ans);
    }
    node query(int p, int l, int r, int L, int R) {
        if (L <= l && r <= R) {
            return val[p];
        }
        node ans;
        int mid = (l + r) >> 1;
        if (L <= mid) {
            ans = merge(ans, query(p << 1, l, mid, L, R));
        }
        if (R > mid) {
            ans = merge(ans, query(p << 1 | 1, mid + 1, r, L, R));
        }
        return ans;
    }
} sgt;
int n, q, l, r;
int main() {
    scanf("%s", sgt.s + 1);
    scanf("%d", &q);
    n = strlen(sgt.s + 1);
    sgt.build(1, 1, n);
    for (int i = 1; i <= q; i++) {
        scanf("%d%d", &l, &r);
        printf("%lld\n", sgt.query(1, 1, n, l, r).ans);
    }
    return 0;
}