#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1000100;
long long n, k, a[maxn];
string s;
struct t {
  long long open = 0, close = 0, ans = 0;
} tree[4 * maxn], ft;
t merge(t x, t y) {
  t temp;
  temp.ans = x.ans + y.ans + min(x.open, y.close);
  temp.open = x.open + y.open - min(x.open, y.close);
  temp.close = x.close + y.close - min(x.open, y.close);
  return temp;
}
void build(long long node, long long start, long long end) {
  if (start > end) return;
  if (start == end) {
    if (s[start] == '(')
      tree[node].open++;
    else
      tree[node].close++;
    return;
  }
  long long mid = (start + end) / 2;
  build(2 * node, start, mid);
  build(2 * node + 1, mid + 1, end);
  tree[node] = merge(tree[2 * node], tree[2 * node + 1]);
}
t query(long long node, long long start, long long end, long long l,
        long long r) {
  if (start > end || start > r || l > end) return ft;
  if (l <= start && end <= r) return tree[node];
  long long mid = (start + end) / 2;
  t p1 = query(2 * node, start, mid, l, r);
  t p2 = query(2 * node + 1, mid + 1, end, l, r);
  return merge(p1, p2);
}
void solve() {
  cin >> s;
  n = s.length();
  build(1, 0, n - 1);
  cin >> k;
  while (k--) {
    long long x, y;
    cin >> x >> y;
    x--;
    y--;
    cout << 2 * query(1, 0, n - 1, x, y).ans << '\n';
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  for (long long i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}
