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;
char s[5003], M1[5003][5003];
int M2[5003][5003];
bool DP1(int i, int j) {
  if (i > j) return true;
  if (M1[i][j] != -1) return M1[i][j];
  return (M1[i][j] = (s[i] == s[j] && DP1(i + 1, j - 1)));
}
int DP2(int i, int j) {
  if (i == j) return 1;
  if (i > j) return 0;
  if (M2[i][j] != -1) return M2[i][j];
  return M2[i][j] =
             DP2(i + 1, j) + DP2(i, j - 1) - DP2(i + 1, j - 1) + DP1(i, j);
}
void solve(int q) {
  int n = strlen(s), l, r, i, j;
  for (i = 0; i < n; ++i)
    for (j = i; j < n; ++j) M1[i][j] = -1, M2[i][j] = -1;
  while (q--) {
    scanf("%d %d", &l, &r);
    printf("%d\n", DP2(l - 1, r - 1));
  }
}
int main() {
  int q;
  scanf("%s %d", s, &q);
  solve(q);
  return 0;
}
