#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000010;
const int inf = 1 << 30;
int curSum[MAXN], n, m, a[3 * MAXN + 100];
string s;
void update(int node, int left, int right, int i, int v) {
  if (left >= right) {
    a[node] = v;
    return;
  }
  int mid = (left + right) / 2;
  if (i <= mid)
    update(node * 2, left, mid, i, v);
  else
    update(node * 2 + 1, mid + 1, right, i, v);
  a[node] = min(a[node * 2], a[2 * node + 1]);
}
int query(int node, int left, int right, int st, int fn) {
  if (st <= left && right <= fn) return a[node];
  int mid = (left + right) / 2, sol = inf;
  if (st <= mid) sol = min(sol, query(node * 2, left, mid, st, fn));
  if (fn > mid) sol = min(sol, query(node * 2 + 1, mid + 1, right, st, fn));
  return sol;
}
int abs(int a) {
  if (a < 0) return -a;
  return a;
}
int main() {
  cin >> s;
  n = s.size();
  for (int i = 0; i < n; ++i) {
    curSum[i + 1] = curSum[i];
    if (s[i] == '(')
      ++curSum[i + 1];
    else
      --curSum[i + 1];
    update(1, 1, n, i + 1, curSum[i + 1]);
  }
  cin >> m;
  for (int i = 1; i <= m; ++i) {
    int l, r;
    cin >> l >> r;
    int last = curSum[r] - curSum[l - 1];
    int minim = query(1, 1, n, l, r) - curSum[l - 1];
    int rez = 0;
    if (minim < 0) {
      minim = -minim;
      last += minim;
      rez += minim;
    }
    rez += abs(last);
    cout << (r - l + 1) - rez << "\n";
  }
  return 0;
}
