/*  Erica N  */
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define int long long
#define ull unsigned long long
#define pii pair<int, int>
#define ps second
#define pf first
#define itn int
#define rd read()
int read(){
    int xx = 0, ff = 1;char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-')ff = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9')xx = xx * 10 + (ch - '0'), ch = getchar();
    return xx * ff;
}
// void write(int out) {
// 	if (out < 0)
// 		putchar('-'), out = -out;
// 	if (out > 9)
// 		write(out / 10);
// 	putchar(out % 10 + '0');
// }
#define cdbg(x...) do { cerr << #x << " -> "; err(x); } while (0)
void err() { cerr << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cerr << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }


const int N = 1e6 + 5;
const int INF = 1e18;
const int M = 1e7;
const int MOD = 1e9 + 7;

string s;

namespace SGT{
    pii t[N<<2];


    pii merge(pii a,pii b){
        int p=min(a.pf,b.ps);
        return make_pair(a.pf+b.pf-p,a.ps+b.ps-p);
    }

    void build(int x,int l,int r){
        if(l==r){
            // cdbg(s[l],l);
            if(s[l]==')')t[x]={0,1};
            else t[x]={1,0};
            return ;
        }
        int mid=l+r>>1;
        build(x<<1,l,mid);
        build(x<<1|1,mid+1,r);
        t[x]=merge(t[x<<1],t[x<<1|1]);
    }


    pii query(int x,int l,int r,int pl,int pr){
        if(pl<=l&&pr>=r)return t[x];
        int mid=l+r>>1;
        if(pr<=mid)return query(x<<1,l,mid,pl,pr);
        if(pl>mid)return query(x<<1|1,mid+1,r,pl,pr);
        return merge( query(x<<1,l,mid,pl,pr),query(x<<1|1,mid+1,r,pl,pr));
    }
}using namespace SGT;

signed main() {
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);

    cin>>s;
    int n=s.size();
    s=" "+s;


    build(1,1,n);
    int q=rd;
    while(q--){
        int l=rd,r=rd;
        pii p=query(1,1,n,l,r);
        // cdbg(l,r,p.pf,p.ps);
        cout<<r-l+1-p.pf-p.ps<<endl;

    }


}