#include <bits/stdc++.h>
using namespace std;
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(long long N, int pos) { return (bool)(N & (1LL << pos)); }
string arr, s;
int m, tot[4 * 1000001], op[4 * 1000001], cl[4 * 1000001];
struct node {
  int a, b, c;
};
void build(int id, int l, int r) {
  if (l == r) {
    if (arr[l] == '(')
      op[id] = 1;
    else
      cl[id] = 1;
    return;
  }
  int mid = (l + r) / 2;
  build(id * 2, l, mid);
  build(id * 2 + 1, mid + 1, r);
  int mn = min(op[id * 2], cl[id * 2 + 1]);
  op[id] = op[id * 2] + op[id * 2 + 1] - mn;
  cl[id] = cl[id * 2] + cl[id * 2 + 1] - mn;
  tot[id] = tot[id * 2] + tot[id * 2 + 1] + mn;
}
node query(int id, int l, int r, int x, int y) {
  if (r < x || l > y) {
    node ret;
    ret.a = ret.b = ret.c = 0;
    return ret;
  }
  if (l >= x && r <= y) {
    node ret;
    ret.a = op[id];
    ret.b = cl[id];
    ret.c = tot[id];
    return ret;
  }
  int mid = (l + r) / 2;
  node ret1 = query(id * 2, l, mid, x, y);
  node ret2 = query(id * 2 + 1, mid + 1, r, x, y);
  node ret;
  int mn = min(ret1.a, ret2.b);
  ret.a = ret1.a + ret2.a - mn;
  ret.b = ret1.b + ret2.b - mn;
  ret.c = ret1.c + ret2.c + mn;
  return ret;
}
int main() {
  cin >> s;
  arr = " ";
  arr += s;
  build(1, 1, s.size());
  scanf("%d", &m);
  int x, y;
  while (m--) {
    scanf("%d %d", &x, &y);
    printf("%d\n", query(1, 1, s.size(), x, y).c * 2);
  }
  return 0;
}
