#include <bits/stdc++.h>
using namespace std;
char s[5005];
int dp[5005][5005];
bool isPalin[5005][5005];
int n;
void clearmem() {
  memset(dp, 0, sizeof dp);
  memset(isPalin, 0, sizeof isPalin);
}
void preCompute() {
  clearmem();
  for (int i = 0; i < n; i++) {
    isPalin[i][i] = true;
    dp[i][i] = 1;
    if (i < n - 1 && s[i] == s[i + 1]) isPalin[i][i + 1] = true;
  }
  for (int sz = 3; sz <= n; sz++) {
    for (int i = 0; i < n - sz + 1; i++) {
      isPalin[i][i + sz - 1] =
          (isPalin[i + 1][i + sz - 2] && (s[i] == s[i + sz - 1]));
    }
  }
}
void compute() {
  preCompute();
  for (int i = 0; i < n - 1; i++) {
    if (isPalin[i][i + 1])
      dp[i][i + 1] = 1;
    else
      dp[i][i + 1] = 0;
    dp[i][i + 1] += dp[i][i] + dp[i + 1][i + 1];
  }
  for (int sz = 3; sz <= n; sz++) {
    for (int i = 0; i < n - sz + 1; i++) {
      if (isPalin[i][i + sz - 1])
        dp[i][i + sz - 1] = 1;
      else
        dp[i][i + sz - 1] = 0;
      dp[i][i + sz - 1] +=
          dp[i + 1][i + sz - 1] + dp[i][i + sz - 2] - dp[i + 1][i + sz - 2];
    }
  }
}
int main() {
  int q;
  scanf("%s", s);
  scanf("%d", &q);
  n = strlen(s);
  compute();
  for (int i = 1; i <= q; i++) {
    int l, r;
    scanf("%d%d", &l, &r);
    printf("%d\n", dp[l - 1][r - 1]);
  }
  return 0;
}
