#include <bits/stdc++.h>
using namespace std;
string second;
int n, l, r;
struct node {
  int a, b, c;
} st[4000001];
node comp(node A, node B) {
  node ans;
  int X = min(A.b, B.c);
  ans.a = A.a + B.a + X * 2;
  ans.b = A.b + B.b - X;
  ans.c = A.c + B.c - X;
  return ans;
}
void build(int v, int l, int r) {
  if (l == r) {
    if (second[l - 1] == '(')
      st[v].b = 1;
    else
      st[v].c = 1;
    return;
  }
  int mid = (l + r) / 2;
  build(v * 2, l, mid);
  build(v * 2 + 1, mid + 1, r);
  st[v] = comp(st[v * 2], st[v * 2 + 1]);
}
node qr(int v, int A, int B, int l, int r) {
  node ans;
  ans.a = ans.b = ans.c = 0;
  if (l > B || r < A) return ans;
  if (A == l && B == r) return st[v];
  int mid = (A + B) / 2;
  node L = qr(v * 2, A, mid, l, min(mid, r));
  node R = qr(v * 2 + 1, mid + 1, B, max(mid + 1, l), r);
  return comp(L, R);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> second;
  cin >> n;
  build(1, 1, second.length());
  while (n--) {
    cin >> l >> r;
    cout << qr(1, 1, second.length(), l, r).a << endl;
  }
  return 0;
}
