#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 100;
const int M = 1e5 + 100;
string s;
int n;
pair<int, int> a[N];
pair<int, pair<int, int>> seg[4 * N];
pair<int, pair<int, int>> merge(pair<int, pair<int, int>> i,
                                pair<int, pair<int, int>> j) {
  pair<int, pair<int, int>> ret;
  int tmp = min(i.second.second, j.second.first);
  ret.first = i.first + j.first + tmp;
  ret.second.first = i.second.first + j.second.first - tmp;
  ret.second.second = i.second.second - tmp + j.second.second;
  return ret;
}
void build(int id, int l, int r) {
  if (l + 1 == r) {
    if (s[l] == '(')
      seg[id] = {0, {0, 1}};
    else
      seg[id] = {0, {1, 0}};
    return;
  }
  int mid = (r + l) >> 1;
  build(2 * id + 0, l, mid);
  build(2 * id + 1, mid, r);
  seg[id] = merge(seg[2 * id], seg[2 * id + 1]);
}
pair<int, pair<int, int>> get(int id, int l, int r, int st, int en) {
  if (st >= r or en <= l) return {0, {0, 0}};
  if (st <= l and r <= en) return seg[id];
  int mid = (r + l) / 2;
  return merge(get(id * 2, l, mid, st, en), get(id * 2 + 1, mid, r, st, en));
}
int main() {
  cin >> s;
  build(1, 0, s.size());
  cin >> n;
  for (int i = 0; i < n; i++) {
    int u, v;
    cin >> u >> v;
    cout << get(1, 0, s.size(), u - 1, v).first * 2 << '\n';
  }
}
