#include <bits/stdc++.h>
using namespace std;
int l, r;
const int MAXN = 1e6 * 4;
int open[MAXN], close[MAXN], valid[MAXN];
string s;
inline void operate(int root) {
  int mi = min(open[root << 1], close[root << 1 | 1]);
  valid[root] = mi * 2 + valid[root << 1] + valid[root << 1 | 1];
  open[root] = open[root << 1] + open[root << 1 | 1] - mi;
  close[root] = close[root << 1] + close[root << 1 | 1] - mi;
}
void build(int root, int le, int re) {
  if (le == re) {
    if (s[le] == '(')
      open[root]++;
    else
      close[root]++;
    return;
  }
  int mid = (le + re) / 2;
  build(root << 1, le, mid);
  build(root << 1 | 1, mid + 1, re);
  operate(root);
}
int getOpen(tuple<int, int, int> &x) { return get<1>(x); }
int getClose(tuple<int, int, int> &x) { return get<2>(x); }
int getValid(tuple<int, int, int> &x) { return get<0>(x); }
tuple<int, int, int> query(int root, int beg, int end) {
  if (end < l || beg > r) {
    return make_tuple(0, 0, 0);
  }
  if (l <= beg && r >= end) {
    return make_tuple(valid[root], open[root], close[root]);
  }
  int mid = (beg + end) / 2;
  tuple<int, int, int> r1 = query(root << 1, beg, mid);
  tuple<int, int, int> r2 = query(root << 1 | 1, mid + 1, end);
  int mi = min(getOpen(r1), getClose(r2));
  return make_tuple(getValid(r1) + getValid(r2) + 2 * mi,
                    getOpen(r1) + getOpen(r2) - mi,
                    getClose(r1) + getClose(r2) - mi);
}
int main() {
  int q;
  while (cin >> s) {
    int len = s.size();
    build(1, 0, len - 1);
    cin >> q;
    while (q--) {
      cin >> l >> r;
      l--;
      r--;
      tuple<int, int, int> res = query(1, 0, len - 1);
      cout << getValid(res) << endl;
    }
  }
  return 0;
}
