#include <bits/stdc++.h>
using namespace std;
string s;
class seg {
 public:
  long long int c, o, t;
  seg() {
    c = 0;
    o = 0;
    t = 0;
  }
};
seg stree[4000005];
long long int prime[168] = {
    2,   3,   5,   7,   11,  13,  17,  19,  23,  29,  31,  37,  41,  43,
    47,  53,  59,  61,  67,  71,  73,  79,  83,  89,  97,  101, 103, 107,
    109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181,
    191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263,
    269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349,
    353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433,
    439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521,
    523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613,
    617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701,
    709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809,
    811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887,
    907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997};
void build_tree(long long int i, long long int st, long long int en) {
  if (st == en) {
    if (s[st] == '(')
      stree[i].o++;
    else
      stree[i].c++;
    return;
  }
  long long int mid = (st + en) / 2;
  build_tree(2 * i + 1, st, mid);
  build_tree(2 * i + 2, mid + 1, en);
  long long int k = min(stree[2 * i + 1].o, stree[2 * i + 2].c);
  stree[i].t = stree[2 * i + 1].t + stree[2 * i + 2].t;
  stree[i].t += 2 * k;
  stree[i].c += stree[2 * i + 1].c + stree[2 * i + 2].c - k;
  stree[i].o += stree[2 * i + 1].o + stree[2 * i + 2].o - k;
}
seg query(long long int i, long long int st, long long int en,
          long long int qst, long long int qen) {
  if (qst <= st && qen >= en) return (stree[i]);
  if (st <= qst && en >= qen) {
    long long int mid = (st + en) / 2;
    seg a, b;
    if (qen > mid && qst <= mid) {
      a = query(2 * i + 1, st, mid, qst, mid);
      b = query(2 * i + 2, mid + 1, en, mid + 1, qen);
    } else {
      a = query(2 * i + 1, st, mid, qst, qen);
      b = query(2 * i + 2, mid + 1, en, qst, qen);
    }
    seg ans;
    ans.t = a.t + b.t;
    long long int k = min(a.o, b.c);
    ans.t += 2 * k;
    ans.c = a.c + b.c - k;
    ans.o = a.o + b.o - k;
    return ans;
  }
  seg ans;
  return ans;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> s;
  long long int l = s.size();
  build_tree(0, 0, l - 1);
  long long int m, a, b;
  cin >> m;
  while (m--) {
    cin >> a >> b;
    a--;
    b--;
    seg a1 = query(0, 0, l - 1, a, b);
    cout << a1.t << endl;
  }
  return 0;
}
