#include <bits/stdc++.h>
using namespace std;
string s;
string t;
int m;
typedef struct node {
  int open;
  int close;
  int rez;
} NODE;
NODE tree[4000001];
void build(int pos, int l, int r) {
  if (l == r) {
    tree[pos] = {0, 0, 0};
    if (s[l] == '(')
      tree[pos].open++;
    else
      tree[pos].close++;
    return;
  }
  int mid = (l + r) / 2;
  build(2 * pos, l, mid);
  build(2 * pos + 1, mid + 1, r);
  tree[pos] = {0, 0, 0};
  NODE a = tree[2 * pos];
  NODE b = tree[2 * pos + 1];
  int buff = min(a.open, b.close);
  tree[pos].open = a.open + b.open - buff;
  tree[pos].close = a.close + b.close - buff;
  tree[pos].rez = a.rez + b.rez + 2 * buff;
}
NODE query(int pos, int l, int r, int ll, int rr) {
  if (ll > r || rr < l) return {0, 0, 0};
  if (l >= ll && r <= rr) return tree[pos];
  int mid = (l + r) / 2;
  NODE a = query(2 * pos, l, mid, ll, rr);
  NODE b = query(2 * pos + 1, mid + 1, r, ll, rr);
  NODE c = {0, 0, 0};
  c.open = a.open + b.open - min(a.open, b.close);
  c.close = a.close + b.close - min(a.open, b.close);
  c.rez = a.rez + b.rez + 2 * min(a.open, b.close);
  return c;
}
int main() {
  cin >> s;
  build(1, 0, s.size() - 1);
  cin >> m;
  for (int i = 0; i < m; i++) {
    int x;
    cin >> x;
    int y;
    cin >> y;
    cout << query(1, 0, s.size() - 1, x - 1, y - 1).rez << endl;
  }
  return 0;
}
