#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int n, q;
string s;
struct node {
  int res = 0, o = 0, c = 0;
} seg[N << 2];
void build(int id = 1, int l = 0, int r = n) {
  if (r - l == 1) {
    (s[l] == '(' ? seg[id].o = 1 : seg[id].c = 1);
    return;
  }
  int mid = (l + r) >> 1;
  build((id << 1), l, mid);
  build((id << 1) ^ 1, mid, r);
  seg[id].o = seg[id << 1].o + seg[(id << 1) ^ 1].o;
  seg[id].c = seg[id << 1].c + seg[(id << 1) ^ 1].c;
  seg[id].res = seg[id << 1].res + seg[(id << 1) ^ 1].res +
                min(seg[id << 1].o - seg[id << 1].res,
                    seg[(id << 1) ^ 1].c - seg[(id << 1) ^ 1].res);
}
node get(int x, int y, int id = 1, int l = 0, int r = n) {
  node ret;
  if (x >= r || y <= l) return ret;
  if (l >= x && r <= y) return seg[id];
  int mid = (l + r) >> 1;
  node s1 = get(x, y, (id << 1), l, mid);
  node s2 = get(x, y, (id << 1) ^ 1, mid, r);
  ret.o = s1.o + s2.o;
  ret.c = s1.c + s2.c;
  ret.res = s1.res + s2.res + min(s1.o - s1.res, s2.c - s2.res);
  return ret;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> s;
  n = s.size();
  build();
  cin >> q;
  while (q--) {
    int l, r;
    cin >> l >> r;
    cout << 2 * get(--l, r).res << '\n';
  }
  return 0;
}
