#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 1;
struct Point {
  int len, o, c;
  Point() : len(-1), o(-1), c(-1) {}
  Point(int len, int o, int c) : len(len), o(o), c(c) {}
};
vector<Point> t;
string s;
void build(int ver, int l, int r) {
  if (r - l == 1) {
    if (s[l] == '(')
      t[ver] = Point(0, 1, 0);
    else if (s[l] == ')')
      t[ver] = Point(0, 0, 1);
  } else {
    int m = l + (r - l) / 2;
    build(ver * 2, l, m);
    build(ver * 2 + 1, m, r);
    Point a = t[ver * 2], b = t[ver * 2 + 1];
    if (a.len == -1 and b.len == -1)
      t[ver] = Point(-1, -1, -1);
    else if (a.len == -1)
      t[ver] = b;
    else if (b.len == -1)
      t[ver] = a;
    else {
      int cnt = min(t[ver * 2].o, t[ver * 2 + 1].c);
      t[ver] = Point(a.len + b.len + 2 * cnt, a.o + b.o - cnt, a.c + b.c - cnt);
    }
  }
}
Point get(int ver, int l, int r, int L, int R) {
  if (r <= L or R <= l)
    return Point(-1, -1, -1);
  else if (l == L and r == R)
    return t[ver];
  else {
    int m = l + (r - l) / 2;
    Point a = get(ver * 2, l, m, L, min(R, m));
    Point b = get(ver * 2 + 1, m, r, max(m, L), R);
    if (a.len == -1 and b.len == -1)
      return Point(-1, -1, -1);
    else if (a.len == -1)
      return b;
    else if (b.len == -1)
      return a;
    else {
      int cnt = min(a.o, b.c);
      return Point(a.len + b.len + 2 * cnt, a.o + b.o - cnt, a.c + b.c - cnt);
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> s;
  t.resize(s.size() * 4);
  build(1, 0, s.size());
  int n;
  cin >> n;
  int l, r;
  for (int i = 0; i < n; ++i) {
    cin >> l >> r;
    cout << get(1, 0, s.size(), l - 1, r).len << "\n";
  }
}
