#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
string s;
class segment_tree {
 public:
  int left, right, pairs;
  segment_tree() { left = right = pairs = 0; }
} tree[N << 2];
void build(int l, int r, int x) {
  if (l == r) {
    tree[x].left = (s[l - 1] == '(');
    tree[x].right = (s[l - 1] == ')');
  } else {
    int mid = l + r >> 1, lc = x + x, rc = lc + 1, let;
    build(l, mid, lc);
    build(mid + 1, r, rc);
    let = min(tree[lc].left, tree[rc].right);
    tree[x].pairs += let + tree[lc].pairs + tree[rc].pairs;
    tree[x].left = tree[lc].left + tree[rc].left - let;
    tree[x].right = tree[lc].right + tree[rc].right - let;
  }
}
segment_tree query(int l, int r, int ql, int qr, int x) {
  if (qr < l || r < ql) {
    segment_tree now;
    return now;
  }
  if (ql <= l && r <= qr) return tree[x];
  int mid = l + r >> 1, lc = x + x, rc = lc + 1;
  segment_tree L = query(l, mid, ql, qr, lc);
  segment_tree R = query(mid + 1, r, ql, qr, rc);
  segment_tree let;
  int temp = 0;
  temp = min(L.left, R.right);
  let.pairs = temp + L.pairs + R.pairs;
  let.left = L.left + R.left - temp;
  let.right = L.right + R.right - temp;
  return let;
}
signed main() {
  int q, l, r;
  cin >> s;
  build(1, s.size(), 1);
  cin >> q;
  while (q--) {
    cin >> l >> r;
    segment_tree temp = query(1, s.size(), l, r, 1);
    cout << (temp.pairs << 1) << '\n';
  }
  return 0;
}
