You've got a string s = s1s2... s|s| of length |s|, consisting of lowercase English letters. There also are q queries, each query is described by two integers li, ri (1 ≤ li ≤ ri ≤ |s|). The answer to the query is the number of substrings of string s[li... ri], which are palindromes.

String s[l... r] = slsl + 1... sr (1 ≤ l ≤ r ≤ |s|) is a substring of string s = s1s2... s|s|.

String t is called a palindrome, if it reads the same from left to right and from right to left. Formally, if t = t1t2... t|t| = t|t|t|t| - 1... t1.

Input

The first line contains string s (1 ≤ |s| ≤ 5000). The second line contains a single integer q (1 ≤ q ≤ 106) — the number of queries. Next q lines contain the queries. The i-th of these lines contains two space-separated integers li, ri (1 ≤ li ≤ ri ≤ |s|) — the description of the i-th query.

It is guaranteed that the given string consists only of lowercase English letters.

Output

Print q integers — the answers to the queries. Print the answers in the order, in which the queries are given in the input. Separate the printed numbers by whitespaces.

Examples

Input

caaaba
5
1 1
1 4
2 3
4 6
4 5


Output

1
7
3
4
2

Note

Consider the fourth query in the first test case. String s[4... 6] = «aba». Its palindrome substrings are: «a», «b», «a», «aba».
#include <bits/stdc++.h>
#pragma optimize("", off)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/STACK:36777216")
const long long inf = 0x3f3f3f3f3f3f3f3LL;
const long long mod = 1e9 + 7;
using namespace std;
template <class T>
void smin(T& a, T val) {
  if (a > val) a = val;
}
template <class T>
void smax(T& a, T val) {
  if (a < val) a = val;
}
template <typename T>
inline std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
  bool first = true;
  os << "[";
  for (auto i : v) {
    if (!first) os << ", ";
    os << i;
    first = false;
  }
  return os << "]";
}
const long long N = 5e3 + 10;
long long ans[N][N];
bool isPalin[N][N];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string s;
  cin >> s;
  long long n = (long long)(s.size());
  for (long long i = 0; i < n; ++i) isPalin[i][i] = 1;
  for (long long len = 2; len <= n; ++len) {
    for (long long i = 0; i < n; ++i) {
      long long j = i + len - 1;
      if (len == 2) {
        isPalin[i][j] = (s[i] == s[j]);
        continue;
      }
      if (j >= n) break;
      isPalin[i][j] = isPalin[i + 1][j - 1] and (s[i] == s[j]);
    }
  }
  for (long long i = 0; i < n; ++i) {
    for (long long j = i + 1; j < n; ++j) {
      if (j - i == 1) {
        isPalin[i][j] = (s[i] == s[j]);
        continue;
      }
      isPalin[i][j] = isPalin[i + 1][j - 1] and (s[i] == s[j]);
    }
  }
  for (long long i = 0; i < n; ++i) {
    for (long long j = i; j < n; ++j) {
      if (j - 1 >= 0) ans[i][j] = ans[i][j - 1];
      ans[i][j] += (long long)(isPalin[i][j]);
    }
  }
  for (long long j = n - 1; j >= 0; --j) {
    for (long long i = j - 1; i >= 0; --i) {
      ans[i][j] += ans[i + 1][j];
    }
  }
  long long q, l, r;
  cin >> q;
  while (q--) {
    cin >> l >> r;
    --l, --r;
    cout << ans[l][r] << '\n';
  }
  return 0;
}
