#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 9;
char s[MAXN];
struct node {
  int ans;
  int opening;
  int closing;
} segTree[4 * MAXN], shit;
void merge(node& mergeInto, const node& a, const node& b) {
  int mina = min(a.opening, b.closing);
  mergeInto.ans = a.ans + b.ans + mina;
  mergeInto.opening = a.opening + b.opening - mina;
  mergeInto.closing = a.closing + b.closing - mina;
}
void build_tree(int v, int l, int r) {
  if (l == r) {
    if (s[l] == '(') {
      segTree[v].opening = 1;
      segTree[v].closing = segTree[v].ans = 0;
    } else {
      segTree[v].closing = 1;
      segTree[v].opening = segTree[v].ans = 0;
    }
    return;
  }
  int mid = (l + r) >> 1;
  build_tree(2 * v, l, mid);
  build_tree(2 * v + 1, mid + 1, r);
  merge(segTree[v], segTree[2 * v], segTree[2 * v + 1]);
}
node query(int v, int l, int r, int start, int end) {
  if (l > r || l > end || r < start) {
    return shit;
  }
  if (l >= start && r <= end) {
    return segTree[v];
  }
  int mid = (l + r) >> 1;
  node res;
  merge(res, query(2 * v, l, mid, start, end),
        query(2 * v + 1, mid + 1, r, start, end));
  return res;
}
int main(int argc, char const* argv[]) {
  scanf("%s", s);
  int n = strlen(s);
  build_tree(1, 0, n - 1);
  int m;
  scanf("%d", &m);
  shit.ans = shit.opening = shit.closing = 0;
  while (m--) {
    int l, r;
    scanf("%d%d", &l, &r);
    l--;
    r--;
    printf("%d\n", 2 * query(1, 0, n - 1, l, r).ans);
  }
  return 0;
}
