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 len;
int pals[5001][5001];
void fillPals(char* str) {
  memset(pals, 0, sizeof(pals));
  for (int k = 0; k < 2; k++)
    for (int i = 0; i < len; i++) {
      for (int j = 0; i - j >= 0 && i + j + k < len; j++)
        if (str[i - j] == str[i + j + k])
          pals[i - j][i + j + k] = 1;
        else
          break;
    }
}
int cnts[5001][5001];
void fillCnts() {
  memset(cnts, 0, sizeof(cnts));
  for (int i = 0; i < len; i++)
    for (int j = 0; j < len; j++)
      cnts[i][j] = +(i > 0 ? cnts[i - 1][j] : 0) +
                   (j > 0 ? cnts[i][j - 1] : 0) -
                   (i > 0 && j > 0 ? cnts[i - 1][j - 1] : 0) + pals[i][j];
}
int main() {
  char str[5001];
  int cse;
  cin >> str;
  len = strlen(str);
  fillPals(str);
  fillCnts();
  cin >> cse;
  while (cse--) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    if (a > 0)
      cout << +cnts[b][b] + -cnts[a - 1][b] - cnts[b][a - 1] +
                  cnts[a - 1][a - 1]
           << endl;
    else
      cout << cnts[b][b] << endl;
  }
}
