#include <bits/stdc++.h>
using namespace std;
mt19937_64 random_num(
    chrono::high_resolution_clock::now().time_since_epoch().count());
const long long MOD = 1000000007;
const int base = 26;
string s, rs;
int n, q;
bool palin[5001][5001];
long long mu[5001];
long long hashS[5001], rhashS[5001];
long long f[5001][5001];
long long getHash(int i, int j, long long *H) {
  return ((H[j] - (H[i - 1] * mu[j - i + 1]) % MOD + MOD)) % MOD;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> s;
  rs = s;
  reverse(rs.begin(), rs.end());
  n = s.size();
  s = ' ' + s;
  rs = ' ' + rs;
  mu[0] = 1;
  for (int i = 1; i <= n; i++) mu[i] = (mu[i - 1] * 26) % MOD;
  for (int i = 1; i <= n; i++) {
    hashS[i] = (hashS[i - 1] * 26 + (s[i] - 'a' + 1)) % MOD;
    rhashS[i] = (rhashS[i - 1] * 26 + (rs[i] - 'a' + 1)) % MOD;
  }
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++)
      palin[i][j] =
          (getHash(i, j, hashS) == getHash(n - j + 1, n - i + 1, rhashS));
  for (int i = 1; i <= n; i++) {
    f[i][i] = 1;
    if (i > 1) f[i - 1][i] = palin[i - 1][i] + 2;
    for (int j = i - 2; j >= 1; j--)
      f[j][i] = (f[j][i - 1] + f[j + 1][i] - f[j + 1][i - 1]) + palin[j][i];
  }
  cin >> q;
  while (q--) {
    int l, r;
    cin >> l >> r;
    cout << f[l][r] << "\n";
  }
}
