#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
string s;
class node {
 public:
  int pairs, open, close;
} tree[4 * N];
node merge(node l, node r) {
  node ret;
  ret.pairs = l.pairs + r.pairs + min(l.open, r.close);
  ret.open = l.open + r.open - min(l.open, r.close);
  ret.close = l.close + r.close - min(l.open, r.close);
  return ret;
}
void build(int root, int start, int end) {
  if (start == end) {
    tree[root].pairs = 0;
    tree[root].open = 1, tree[root].close = 0;
    if (s[start] == ')') swap(tree[root].open, tree[root].close);
    return;
  }
  int mid = (start + end) >> 1;
  build(2 * root, start, mid);
  build(2 * root + 1, mid + 1, end);
  tree[root] = merge(tree[2 * root], tree[2 * root + 1]);
}
node query(int root, int i, int j, int start, int end) {
  if (i <= start && j >= end) return tree[root];
  int mid = (start + end) >> 1;
  if (j <= mid)
    return query(2 * root, i, j, start, mid);
  else if (i > mid)
    return query(2 * root + 1, i, j, mid + 1, end);
  else
    return merge(query(2 * root, i, j, start, mid),
                 query(2 * root + 1, i, j, mid + 1, end));
}
int main() {
  cin >> s;
  int len = s.length();
  build(1, 0, len - 1);
  int m, x, y;
  cin >> m;
  for (int i = 0; i < m; i++) {
    scanf("%d %d", &x, &y);
    printf("%d\n", query(1, x - 1, y - 1, 0, len - 1).pairs * 2);
  }
}
