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 cnt[5005][5005];
int len;
char st[5005];
bool palin[5005][5005];
void updateFreq(int r, int c) {
  int cc;
  while (r <= len) {
    cc = c;
    while (cc <= len) {
      cnt[r][cc]++;
      cc += (cc & (-cc));
    }
    r += (r & (-r));
  }
}
int readFreq(int r, int c) {
  int ret = 0;
  int cc;
  while (r > 0) {
    cc = c;
    while (cc > 0) {
      ret += cnt[r][cc];
      cc -= (cc & (-cc));
    }
    r -= (r & (-r));
  }
  return ret;
}
int main() {
  scanf("%s", st + 1);
  len = strlen(st + 1);
  int q;
  scanf("%d", &q);
  for (int d = 0, lets_stop_here = (int)len + 1; d < lets_stop_here; d++) {
    for (int i = 1, lets_stop_here = (int)len; i <= lets_stop_here; i++) {
      int j = i + d;
      if (j > len) break;
      if (i == j)
        palin[i][j] = true;
      else if (j - i == 1)
        palin[i][j] = st[i] == st[j] ? true : false;
      else if (palin[i + 1][j - 1])
        palin[i][j] = st[i] == st[j] ? true : false;
      else
        palin[i][j] = false;
      if (palin[i][j]) updateFreq(i, j);
    }
  }
  while (q--) {
    int l, r;
    scanf("%d %d", &l, &r);
    int ans = readFreq(r, r) - readFreq(r, l - 1) - readFreq(l - 1, r) +
              readFreq(l - 1, l - 1);
    printf("%d\n", ans);
  }
  return 0;
}
