#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (a < b)
    return gcd(b, a);
  else if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
long long int isPrime(long long int n) {
  long long int p = (long long int)sqrt(n);
  for (long long int i = (2); i <= (p); i += (1))
    if (n % i == 0) return 0;
  return 1;
}
long long int pow(long long int b, long long int e) {
  if (e == 0)
    return 1;
  else if (e % 2 == 0) {
    long long int a = pow(b, e / 2);
    return a * a;
  } else {
    long long int a = pow(b, e / 2);
    return b * a * a;
  }
}
long long int powm(long long int x, long long int y,
                   long long int m = 1000000007) {
  x = x % m;
  long long int res = 1;
  while (y) {
    if (y & 1) res = res * x;
    res %= m;
    y = y >> 1;
    x = x * x;
    x %= m;
  }
  return res;
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
long long int modInverse(long long int a, long long int m) {
  return powm(a, m - 2, m);
}
bool issq(long long int n) {
  long long int p = sqrt(n);
  return p * p == n;
}
long long int MIN(long long int a = 2e18, long long int b = 2e18,
                  long long int c = 2e18, long long int d = 2e18,
                  long long int e = 2e18) {
  return min(a, min(b, min(c, min(d, e))));
}
long long int MAX(long long int a = -2e18, long long int b = -2e18,
                  long long int c = -2e18, long long int d = -2e18,
                  long long int e = -2e18) {
  return max(a, max(b, max(c, max(d, e))));
}
vector<long long int> prime;
void seive(long long int n) {
  prime.resize(n + 1);
  for (long long int i = (2); i <= (n); i += (1))
    if (prime[i] == 0) {
      prime[i] = i;
      for (long long int j = (i * i); j <= (n); j += (i))
        if (prime[j] == 0) prime[j] = i;
    }
}
long long int extended_GCD(long long int a, long long int b, long long int &x,
                           long long int &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long int x1, y1;
  long long int gcd = extended_GCD(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return gcd;
}
long long int mulInv(long long int a, long long int mod) {
  long long int x, y;
  extended_GCD(a, mod, x, y);
  if (x < 0) x += mod;
  return x;
}
template <typename T>
void swap(T *x, T *y) {
  T z = *x;
  *x = *y;
  *y = z;
}
template <typename T>
void print(T a[], long long int start, long long int end) {
  for (long long int i = (start); i <= (end); i += (1)) cout << a[i] << " ";
  cout << "\n";
}
template <typename T>
void print(T a, long long int start = 0, long long int end = 1e9) {
  end = min(end, (long long int)a.size() - 1);
  for (long long int i = (start); i <= (end); i += (1)) cout << a[i] << " ";
  cout << "\n";
}
template <typename T, typename P>
void print(vector<pair<T, P>> v, long long int start = 0,
           long long int end = 1e9) {
  end = min(end, (long long int)v.size() - 1);
  for (long long int i = (start); i <= (end); i += (1))
    cout << v[i].first << " " << v[i].second, cout << "\n";
  ;
}
long long int find(long long int num[], long long int rem[], long long int k,
                   long long int prod) {
  long long int result = 0;
  for (long long int i = 0; i < k; i++) {
    long long int pp = prod / num[i];
    result += rem[i] * mulInv(pp, num[i]) * pp;
  }
  return result % prod;
}
bool comp(pair<long long int, pair<long long int, long long int>> p1,
          pair<long long int, pair<long long int, long long int>> p2) {
  return (p1.first < p2.first);
}
struct group {
  long long int c = 0;
  long long int r = 0;
  long long int l = 0;
};
class Segment {
 public:
  vector<group> tree;
  string s;

 public:
  Segment(long long int n, string a) {
    tree.resize(4 * n + 1);
    s = a;
    s = " " + s;
    build(1, 1, n);
  }
  group combine(group g1, group g2) {
    group g;
    long long int x = min(g1.r, g2.l);
    g.c = g1.c + g2.c + x;
    g.l = g1.l + g2.l - x;
    g.r = g1.r + g2.r - x;
    return g;
  }

 public:
  void build(long long int node, long long int l, long long int r) {
    if (l == r) {
      group g1;
      if (s[l] == '(')
        g1.r = 1;
      else
        g1.l = 1;
      tree[node] = g1;
    } else {
      long long int mid = (l + r) / 2;
      build(node * 2, l, mid);
      build(node * 2 + 1, mid + 1, r);
      tree[node] = combine(tree[2 * node], tree[2 * node + 1]);
    }
  }
  group get(long long int p, long long int q, long long int l, long long int r,
            long long int node) {
    long long int mid = (l + r) / 2;
    if (p <= l && r <= q)
      return tree[node];
    else if (l > q || r < p) {
      group g;
      return g;
    } else
      return combine(get(p, q, l, mid, 2 * node),
                     get(p, q, mid + 1, r, 2 * node + 1));
  }
};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s;
  cin >> s;
  Segment seg(s.length() + 1, s);
  long long int T;
  cin >> T;
  while (T--) {
    long long int x, y;
    cin >> x >> y;
    group g1 = seg.get(x, y, 1, s.length() + 1, 1);
    cout << g1.c * 2;
    cout << "\n";
  }
  return 0;
}
