#include <bits/stdc++.h>
using namespace std;
int dp[5000][5000] = {0};
bool p[5000][5000] = {0};
string s;
int q, l, r, n;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int TESTS = 1;
  while (TESTS--) {
    cin >> s;
    cin >> q;
    n = s.size();
    memset(dp, 0, sizeof(dp));
    memset(p, false, sizeof(p));
    for (long long int i = 0; i < n; i++) p[i][i] = true;
    for (long long int i = 0; i < n - 1; i++)
      if (s[i] == s[i + 1]) p[i][i + 1] = true, dp[i][i + 1] = 1;
    for (long long int g = 2; g < n; g++)
      for (long long int i = 0; i < n - g; i++) {
        int j = i + g;
        if (s[i] == s[j] && p[i + 1][j - 1]) p[i][j] = true;
        if (p[i][j] == true)
          dp[i][j] = dp[i][j - 1] + 1 + dp[i + 1][j] - dp[i + 1][j - 1];
        else
          dp[i][j] = dp[i][j - 1] + dp[i + 1][j] - dp[i + 1][j - 1];
      }
    for (long long int i = 0; i < q; i++) {
      cin >> l >> r;
      cout << dp[l - 1][r - 1] + r - l + 1 << '\n';
    }
  }
  return 0;
}
