#include <bits/stdc++.h>
using namespace std;
const int maxn = int(1e5) + 123;
const int inf = 1 << 30;
const int mod = int(1e9) + 7;
const int base = 257;
char second[5005];
int n, m, i, j, len, l, r;
long long d[5003][5003];
int hl[5005], hr[5005], pw[5005];
int getL(int l, int r) {
  return (hl[r] + mod - (1ll * hl[l - 1] * pw[r - l + 1]) % mod) % mod;
}
int getR(int l, int r) {
  return (hr[l] + mod - (1ll * hr[r + 1] * pw[r - l + 1]) % mod) % mod;
}
int main() {
  gets(second);
  n = strlen(second);
  pw[0] = 1;
  for (int i = 1; i <= n; i++) {
    hl[i] = (1ll * hl[i - 1] * base + second[i - 1]) % mod;
    pw[i] = (1ll * pw[i - 1] * base) % mod;
    d[i][i] = 1;
  }
  for (int i = n; i >= 1; i--) {
    hr[i] = (1ll * hr[i + 1] * base + second[i - 1]) % mod;
  }
  for (len = 2; len <= n; len++)
    for (i = 1; i + len - 1 <= n; i++) {
      j = i + len - 1;
      d[i][j] = d[i + 1][j] + d[i][j - 1] - d[i + 1][j - 1];
      if (getL(i, j) == getR(i, j)) d[i][j]++;
    }
  scanf("\n%d", &m);
  for (i = 1; i <= m; i++) {
    scanf("\n%d %d", &l, &r);
    printf("%I64d\n", d[l][r]);
  }
  return 0;
}
