#include<bits/stdc++.h>
#define int long long
#define N 1000010
#define ls now<<1
#define rs now<<1|1
using namespace std;
namespace IO{
	template<typename T> inline void read(T &x){
		bool f=1;x=0;char ch=getchar();
		while(ch<'0'||ch>'9'){if(ch=='-')f=0;ch=getchar();}
		while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch&15),ch=getchar();
		x=f?x:-x;
	}
	template<typename T> inline void write(T x){
		if(x<0) putchar('-'),x=-x;
	   	if(x>9) write(x/10);
	   	putchar(('0'+x%10));
	}
	template <typename T,typename ...Args> inline void read(T &x,Args &...args){read(x);read(args...);}
	template<typename T> inline void write(T x,char c){write(x),putchar(c);}
}
using namespace IO;
char c[1000005];
int n,Q,sum[1000005],st[1000005],top;
int l[1000005],r[1000005],v[1000005];
int a[1000005],tr[4000005];
void init(int l,int r,int now){
	if(l==r){
		tr[now]=a[l];
		return;
	}
	int mid=(l+r)>>1;
	init(l,mid,ls);
	init(mid+1,r,rs);
	tr[now]=min(tr[ls],tr[rs]);
}
inline int query(int now,int l,int r,int tol,int tor){
	if(tol<=l&&r<=tor) return tr[now];
	int res=n,mid=(l+r)>>1;
	if(tol<=mid)res=min(res,query(ls,l,mid,tol,tor));
	if(tor>mid) res=min(res,query(rs,mid+1,r,tol,tor));
	return res;
}
signed main(){
	scanf("%s",c+1);read(Q);
	n=strlen(c+1);
	for(int i=1;i<=n;++i){
		if(!top && c[i]==')')v[i]=1;
		else if(c[i]=='(')st[++top]=i;
		else{
			sum[i]=st[top],sum[st[top]]=i;
			a[st[top]]++,a[i+1]--;
			l[st[top]+1]++,l[i+1]--;
			r[st[top]]++,r[i]--;
			top--;
		}
	}
	for(;top;--top) v[st[top]]=1;
	for(int i=1;i<=n;++i){
		a[i]+=a[i-1];
		r[i]+=r[i-1];
		l[i]+=l[i-1];
	}
	for(int i=1;i<=n;++i)a[i]-=!v[i],v[i]+=v[i-1];
	init(1,n,1);
	for(int i=1,x,y;i<=Q;++i){
		read(x,y);
		write(max(0ll,y-x+1-(v[y]-v[x-1])-r[y]-l[x]+query(1,n,1,x,y)*2),'\n');
	}
}