//
//  na 2037.cpp
//  Competitive Programming
//
//  Created by m2 on 2024/11/25.
//

#include <stdio.h>
#include <iostream>
#include <set>
using namespace std;
#ifdef MAC_OS_VERSION_11_0
const int maxn = 1e3 + 5, maxdep = 20;
#else
const int maxn = 1e6 + 5, maxdep = 20;
#endif
int n, q, sm[maxn], st[maxn][maxdep], lg2[maxn], nxt[maxn][maxdep], las[maxn][maxdep], sl[maxn], sr[maxn];
char s[maxn];
inline void init_sums(){
    for(int i = 1; i <= n; ++i){
        sm[i] = sm[i - 1] + (s[i] == '('? 1: -1);
        sl[i] = sl[i - 1] + (s[i] == '(');
        sr[i] = sr[i - 1] + (s[i] == ')');
    }
}
inline void init_st(){
    for(int i = n; i; --i){
        st[i][0] = sm[i];
        for(int j = 1; j < maxdep; ++j)
            st[i][j] = min(st[i][j - 1], st[min(n, i + (1 << (j - 1)))][j - 1]);
    }
    lg2[1] = 0;
    for(int i = 2; i <= n; ++i)
        lg2[i] = lg2[i >> 1] + 1;
}
inline int query(int lt, int rt){
    int dep = lg2[rt - lt + 1];
    return min(st[lt][dep], st[rt - (1 << dep) + 1][dep]);
}
inline void init_chain(){
    int ls = 0;
    for(int i = 1; i <= n + 1; ++i){
        las[i][0] = ls;
        for(int j = 1; j < maxdep; ++j)
            las[i][j] = las[las[i][j - 1]][j - 1];
        if(s[i] == ')')
            ls = i;
    }
    for(int i = 0; i < maxdep; ++i)
        nxt[n + 1][i] = n + 1;
    ls = n + 1;
    for(int i = n; i >= 0; --i){
        nxt[i][0] = ls;
        for(int j = 1; j < maxdep; ++j)
            nxt[i][j] = nxt[nxt[i][j - 1]][j - 1];
        if(s[i] == '(')
            ls = i;
    }
}
inline void readint(int &v){
    v = 0;
    char r = getchar();
    while(r - 48 >= 10u)
        r = getchar();
    do{
        v = (v << 1) + (v << 3) + (r ^ 48);
        r = getchar();
    }while(r - 48 < 10u);
}
namespace qprintint{
char buf[15];
inline void printint(int v){
    int p = 0;
    while(v){
        buf[p++] = (v % 10) ^ 48;
        v /= 10;
    }
    if(!p)
        putchar('0');
    else{
        while(p--)
            putchar(buf[p]);
    }
}
}
using qprintint::printint;
inline void solve(int l, int r){
//    cerr << "solve " << l << " -> " << r << endl;
    int lim = min(sl[r] - sl[l - 1], sr[r] - sr[l - 1]), ans = 0, ra;
//    cerr << "never exceeds " << lim << endl;
    int lst = l - (s[l] == '('), rst = r + (s[r] == ')'), lp, rp;
    for(int i = maxdep - 1, d = 1 << (maxdep - 1); i >= 0; --i, d >>= 1)
        if((ra = ans + d) <= lim){
//            cerr << "  try " << ans << " -> " << ra << endl;
            lp = nxt[lst][i];
            rp = las[rst][i];
//            cerr << "    lp: " << lst << " -> " << lp << endl;
//            cerr << "    rp: " << rst << " -> " << rp << endl;
//            if(lp >= rp){
//                cerr << "      max neg: " << -(query(rp, lp) - sm[rp - 1]) << ", base: " << sl[rp - 1] - sl[l - 1] << endl;
//            }
            if(lp < rp || -(query(rp, lp) - sm[rp - 1]) <= sl[rp - 1] - sl[l - 1]){
//                cerr << "  success" << endl;
                ans = ra;
                lst = lp;
                rst = rp;
            }
        }
    printint(ans << 1);
    putchar('\n');
}
int main(){
    cin.tie(0)->sync_with_stdio(false);
    while(true){
        char r = getchar();
        if(r != '(' && r != ')')
            break;
        s[++n] = r;
    }
    readint(q);
    init_sums();
    init_st();
    init_chain();
    while(q--){
        int l, r;
        readint(l); readint(r);
        solve(l, r);
    }
    fflush(stdout);
    return 0;
}