#include <bits/stdc++.h>
using namespace std;
long long powmod(long long a, long long b) {
  long long res = 1;
  if (a >= 1000000007) a %= 1000000007;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a;
    if (res >= 1000000007) res %= 1000000007;
    a = a * a;
    if (a >= 1000000007) a %= 1000000007;
  }
  return res;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int n;
string x;
int dp[5001][5001];
bool isPalindrome[5001][5001];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> x;
  cin >> n;
  int z = x.size() - 1;
  int i, j;
  for (i = 0; i <= 5000; i++) {
    for (j = 0; j <= 5000; j++) {
      dp[i][j] = 0;
      isPalindrome[i][j] = false;
    }
  }
  for (i = 0; i <= z; i++) {
    isPalindrome[i][i] = true;
    dp[i][i] = 1;
    if (i != z) {
      isPalindrome[i + 1][i] = true;
    }
  }
  for (int l = 1; l <= z; l++) {
    i = 0;
    j = l;
    while (i <= z && j <= z) {
      isPalindrome[i][j] = (isPalindrome[i + 1][j - 1]) & (x[i] == x[j]);
      dp[i][j] =
          dp[i][j - 1] + dp[i + 1][j] - dp[i + 1][j - 1] + (isPalindrome[i][j]);
      i++;
      j++;
    }
  }
  for (i = 1; i <= n; i++) {
    int l, r;
    cin >> l >> r;
    l--;
    r--;
    cout << dp[l][r] << "\n";
  }
  return 0;
}
