#include <bits/stdc++.h>
using namespace std;
int tree[4000009][3];
int a[1000009];
void init(int node, int b, int e) {
  if (b == e) {
    tree[node][a[b]] = 1;
    tree[node][1 - a[b]] = 0;
    tree[node][2] = 0;
    return;
  }
  int mid = (b + e) / 2;
  int left = node * 2;
  int right = node * 2 + 1;
  init(left, b, mid);
  init(right, mid + 1, e);
  tree[node][2] = min(tree[left][0], tree[right][1]);
  tree[node][0] = tree[left][0] - tree[node][2] + tree[right][0];
  tree[node][1] = tree[left][1] + tree[right][1] - tree[node][2];
  tree[node][2] += tree[left][2] + tree[right][2];
}
pair<int, pair<int, int>> query(int node, int b, int e, int l, int r) {
  if (l > e || r < b) return {0, {0, 0}};
  if (b >= l && e <= r) return {tree[node][2], {tree[node][0], tree[node][1]}};
  int mid = b + e >> 1;
  int left = node * 2;
  int right = node * 2 + 1;
  pair<int, pair<int, int>> p1 = query(left, b, mid, l, r);
  pair<int, pair<int, int>> p2 = query(right, mid + 1, e, l, r);
  int mn = min(p1.second.first, p2.second.second);
  int tot = p1.first + p2.first + mn;
  int lf = p1.second.first + p2.second.first - mn;
  int rf = p1.second.second + p2.second.second - mn;
  return {tot, {lf, rf}};
}
int main() {
  string s;
  cin >> s;
  int n = s.length();
  for (int i = 0; i < n; i++) {
    if (s[i] == '(')
      a[i + 1] = 0;
    else
      a[i + 1] = 1;
  }
  int q;
  cin >> q;
  init(1, 1, n);
  while (q--) {
    int l, r;
    cin >> l >> r;
    cout << 2 * query(1, 1, n, l, r).first << endl;
  }
}
