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 xx[5003][5003];
int n, m, bit[5003][5003];
int query(int x, int y) {
  int res = 0;
  for (int i = x; i >= 0; i = (i & (i + 1)) - 1)
    for (int j = y; j >= 0; j = (j & (j + 1)) - 1) res += bit[i][j];
  return res;
}
void inc(int x, int y, int delta) {
  for (int i = x; i < n; i = (i | (i + 1)))
    for (int j = y; j < m; j = (j | (j + 1))) bit[i][j] += delta;
}
int main() {
  string s;
  int kk;
  while (cin >> s) {
    cin >> kk;
    int len = s.size(), inf, sup;
    n = m = len;
    memset(xx, 0, sizeof(xx));
    memset(bit, 0, sizeof(bit));
    for (int i = (int)0; i < (int)len; i++) {
      inf = i, sup = i;
      while (inf >= 0 && sup < len && s[inf] == s[sup])
        xx[inf][sup] = 1, inf--, sup++;
      inf = i - 1, sup = i;
      while (inf >= 0 && sup < len && s[inf] == s[sup])
        xx[inf][sup] = 1, inf--, sup++;
      inf = i, sup = i + 1;
      while (inf >= 0 && sup < len && s[inf] == s[sup])
        xx[inf][sup] = 1, inf--, sup++;
    }
    for (int i = (int)0; i < (int)len; i++) {
      for (int j = (int)0; j < (int)len; j++) inc(i, j, xx[i][j]);
    }
    while (kk--) {
      scanf("%d %d", &inf, &sup);
      inf--, sup--;
      int a = query(sup, sup), b = query(inf - 1, sup);
      printf("%d\n", a - b);
    }
  }
  return 0;
}
