#include <bits/stdc++.h>
using namespace std;
int Q, hd[5005], ht[5005], prm[5005], n = 1, dyn[5005][5005];
char str[5005];
int pal(int b, int e) {
  return (hd[e] - hd[b - 1]) * prm[n - e] == (ht[b] - ht[e + 1]) * prm[b - 1];
}
int fun(int bgn, int end) {
  if (dyn[bgn][end] != -1) return dyn[bgn][end];
  if (end == bgn) return dyn[bgn][end] = 1;
  if (end - 1 == bgn) return dyn[bgn][end] = pal(bgn, end) + 2;
  return dyn[bgn][end] = fun(bgn + 1, end) + fun(bgn, end - 1) -
                         fun(bgn + 1, end - 1) + pal(bgn, end);
}
int main() {
  scanf(" %s", str + 1);
  n = strlen(str + 1);
  prm[0] = 1;
  memset(dyn, -1, sizeof(dyn));
  for (int i = 1; i <= n; i++) prm[i] = prm[i - 1] * 37;
  for (int i = 1; i <= n; i++)
    hd[i] = hd[i - 1] + prm[i - 1] * (str[i] - 'a' + 1);
  for (int i = n; i > 0; i--)
    ht[i] = ht[i + 1] + prm[n - i] * (str[i] - 'a' + 1);
  scanf("%d", &Q);
  for (int i = 1, a, b; i <= Q; i++) {
    scanf("%d %d", &a, &b);
    printf("%d\n", fun(a, b));
  }
}
