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>
using namespace std;
int in() {
  int x;
  return scanf("%d", &x), x;
}
int &in(int &x) { return x = in(); }
template <typename T, typename... Args>
void in(T &x, Args &...args) {
  in(x);
  if (sizeof...(args)) in(args...);
}
template <class T, class L>
T &smax(T &x, L y) {
  return x < y ? x = y : x;
}
template <class T, class L>
T &smin(T &x, L y) {
  return x > y ? x = y : x;
}
const int maxn = 1e4 + 17;
char s[maxn];
int n;
int seg[maxn / 2][maxn / 2];
void DeemoLovesInit() {
  char tmp[maxn];
  scanf("%s", tmp), n = strlen(tmp) * 2 - 1;
  for (int i = 0; i < n; i++)
    if (i & 1)
      s[i] = '#';
    else
      s[i] = tmp[i / 2];
}
void shift() {
  for (int i = 1; i < maxn / 2; i++)
    for (int j = 0; j < maxn / 2; j++) seg[i][j] += seg[i - 1][j];
  for (int i = 0; i < maxn / 2; i++)
    for (int j = 1; j < maxn / 2; j++) seg[i][j] += seg[i][j - 1];
}
int get(int l, int r) {
  l /= 2;
  return seg[r / 2][maxn / 2 - 1] - (l ? seg[r / 2][l - 1] : 0);
}
int main() {
  DeemoLovesInit();
  for (int i = 0; i < n; i++)
    for (int l = i, r = i; l >= 0 && r < n; l--, r++)
      if (s[l] == s[r]) {
        if (s[l] != '#') {
          seg[r / 2][l / 2]++;
        }
      } else
        break;
  shift();
  int q = in();
  for (int l, r; q--;) in(l, r), printf("%d\n", get(l * 2 - 2, r * 2 - 2));
  return 0;
}
