#include <bits/stdc++.h>
using namespace std;
const long long MX = 100000;
const long long MOD = 1000000007;
long long fast_exp(long long base, long long exp, long long mod) {
  long long res = 1;
  while (exp > 0) {
    if (exp % 2 == 1) res = (res * base) % mod;
    base = (base * base) % mod;
    exp /= 2;
  }
  return res;
}
int dp[5010][5010];
int pal[5010][5010];
char s[5010];
int q, l, r, n;
int main() {
  ios_base::sync_with_stdio(false);
  ;
  cin.tie(NULL);
  cin >> s;
  n = strlen(s);
  for (int i = 0, _i = (n); i < _i; ++i) {
    dp[i][i] = pal[i][i] = 1;
    pal[i + 1][i] = 1;
  }
  for (int len = 2; len <= n; len++) {
    for (int start = 0; start <= n - len; start++) {
      pal[start][start + len - 1] =
          pal[start + 1][start + len - 2] & (s[start] == s[start + len - 1]);
      dp[start][start + len - 1] =
          dp[start][start + len - 2] + dp[start + 1][start + len - 1] -
          dp[start + 1][start + len - 2] + pal[start][start + len - 1];
    }
  }
  cin >> q;
  while (q--) {
    cin >> l >> r;
    --l, --r;
    cout << dp[l][r] << "\n";
  }
  return 0;
}
