#include <bits/stdc++.h>
using namespace std;
const int maxn = 5010;
char str[maxn];
int p[maxn][maxn];
int dp[maxn][maxn];
int dfs2(int x, int y) {
  if (p[x][y] != -1) return p[x][y];
  if (x == y) return p[x][y] = 1;
  if (x + 1 == y)
    p[x][y] = str[x] == str[y];
  else
    p[x][y] = (str[x] == str[y]) && dfs2(x + 1, y - 1);
  return p[x][y];
}
int dfs(int x, int y) {
  if (x > y) return 0;
  if (dp[x][y] != -1) return dp[x][y];
  if (x == y) {
    return dp[x][y] = 1;
  }
  dp[x][y] = dfs(x + 1, y) + dfs(x, y - 1) - dfs(x + 1, y - 1);
  dp[x][y] += dfs2(x, y);
  return dp[x][y];
}
int main() {
  scanf("%s", str);
  int len = strlen(str);
  memset(dp, -1, sizeof(dp));
  memset(p, -1, sizeof(p));
  dfs(0, len - 1);
  int T;
  cin >> T;
  while (T--) {
    int x, y;
    scanf("%d %d", &x, &y);
    printf("%d\n", dfs(x - 1, y - 1));
  }
  return 0;
}
