#include <bits/stdc++.h>
using namespace std;
char s[1000010];
struct Node {
  int left, right, match, x, y;
} node[1000010 * 4];
struct SegTree {
  void create(int x, int y, int root = 1) {
    node[root].x = x, node[root].y = y;
    if (x == y) {
      node[root].match = 0;
      if (s[x] == '(') {
        node[root].left = 1, node[root].right = 0;
      } else {
        node[root].left = 0, node[root].right = 1;
      }
    } else {
      create(x, (x + y) / 2, root * 2);
      create((x + y) / 2 + 1, y, root * 2 + 1);
      int c = min(node[root * 2].left, node[root * 2 + 1].right);
      node[root].match = node[root * 2].match + node[root * 2 + 1].match + c;
      node[root].left = node[root * 2].left + node[root * 2 + 1].left - c;
      node[root].right = node[root * 2].right + node[root * 2 + 1].right - c;
    }
  }
  int search(int x, int y, int &left, int &right, int root = 1) {
    if (x <= node[root].x && node[root].y <= y) {
      left = node[root].left, right = node[root].right;
      return node[root].match;
    }
    if (x > node[root].y || y < node[root].x) {
      left = right = 0;
      return 0;
    }
    int lleft, lright, rleft, rright, match;
    match = search(x, y, lleft, lright, root * 2) +
            search(x, y, rleft, rright, root * 2 + 1);
    int c = min(lleft, rright);
    left = lleft + rleft - c;
    right = lright + rright - c;
    return match + c;
  }
} tree;
int main() {
  scanf("%s", s + 1);
  int n = strlen(s + 1);
  tree.create(1, n);
  int m, x, y, left, right;
  cin >> m;
  for (int i = 0; i < m; ++i) {
    cin >> x >> y;
    cout << tree.search(x, y, left, right) * 2 << endl;
  }
  return 0;
}
