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 dp[5050][5050];
int pal[5050][5050];
int len;
char s[5004];
void fastscan(int &number) {
  bool negative = false;
  register int c;
  number = 0;
  c = getchar();
  if (c == '-') {
    negative = true;
    c = getchar();
  }
  for (; (c > 47 && c < 58); c = getchar()) number = number * 10 + c - 48;
  if (negative) number *= -1;
}
int ispal(int i, int j) {
  if (i > j) return true;
  if (s[i] != s[j]) return false;
  if (pal[i][j] != -1) return pal[i][j];
  return pal[i][j] = (s[i] == s[j] && ispal(i + 1, j - 1));
}
int solve(int i, int j) {
  if (j < 0 || i >= len || i > j) return 0;
  if (dp[i][j] != -1) return dp[i][j];
  return dp[i][j] = solve(i + 1, j) + solve(i, j - 1) - solve(i + 1, j - 1) +
                    ispal(i, j);
}
int main() {
  memset(dp, -1, sizeof(dp));
  memset(pal, -1, sizeof(pal));
  gets(s);
  len = strlen(s);
  int q;
  fastscan(q);
  for (int i = 1; i <= q; i++) {
    int a, b;
    fastscan(a);
    fastscan(b);
    printf("%d\n", solve(a - 1, b - 1));
  }
}
