#include<bits/stdc++.h>
using namespace std;
char s[1000005];int n,q;
vector<pair<int,int> >query[1000005];
int ans[1000005],suf[1000005],pre[1000005],ex1[1000005],ex2[1000005];
void solve(int l,int r){
	if(l == r){
		for(int i =0;i<query[l].size();i++)ans[query[l][i].second] = 0;query[l].clear();return;
	}int mid = l+r>>1;
	solve(mid+1,r);int tot =0 ;
	pre[0] = suf[0] = ex1[0] = ex2[0] = 0;
	for(int i = mid;i>=l;i--){
		pre[mid-i+1] = pre[mid-i],ex1[mid-i+1] = ex1[mid-i];
		if(s[i] == ')'){
			tot++;
		}else{
			if(tot)tot--,pre[mid-i+1]+=2;
			else ex1[mid-i+1]++;
		}
	}tot = 0;
	for(int i = mid+1;i<=r;i++){
		suf[i-mid] = suf[i-mid-1],ex2[i-mid] = ex2[i-mid-1];
		if(s[i] == '(')tot++;
		else{
			if(tot)tot--,suf[i-mid]+=2;
			else ex2[i-mid]++;
		}
	}for(int i = mid;i>=l;i--){
		int cnt =0 ;
		for(int j = query[i].size()-1;j>=0;j--){
			if(query[i][j].first<=mid)break;cnt++;
			assert(query[i][j].first<=r);
			int rr = query[i][j].first;
			
			ans[query[i][j].second] = 2*min(ex1[mid-i+1],ex2[rr-mid])+pre[mid-i+1]+suf[rr-mid];
		//	cout << i << " " << query[i][j].first << " " << ans[query[i][j].second] << " " << mid << " " << pre[mid-i+1] << " " << suf[rr-mid] << endl;
		}for(int j =0;j<cnt;j++)query[i].pop_back();
	}solve(l,mid);
}inline void write(int x){
	if(x>=10)write(x/10);
	putchar(x%10+'0');
}inline int read(){
	int x = 0;char c=  getchar();
	while(c<'0' or c>'9')c = getchar();
	while('0'<=c and c<='9')x = x*10+(c^48),c = getchar();
	return x;
}
signed main(){
//	freopen("in.txt","r",stdin);
	scanf("%s",s+1);q = read();n = strlen(s+1);
//	for(int i = 1;i<=n;i++)cout << s[i];cout << endl;
	for(int i = 1;i<=q;i++){
		int l = read(),r = read();
		query[l].push_back(make_pair(r,i));
	}for(int i = 1;i<=n;i++)sort(query[i].begin(),query[i].end());
	solve(1,n);
	for(int i = 1;i<=q;i++){
		write(ans[i]);putchar('\n');
	}
	return 0;
}