CF245H：Queries for Number of Palindromes（dp & 区间回文串数量）

H. Queries for Number of Palindromes

time limit per test

5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 qlines 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».

题意：给Q个询问，输出指定区间里的回文串数量。

思路：O(n^2)预处理dp[i][j]，i到j的回文串个数，同时判断is[i][j]是否回文串，dp转移公式根据容斥定理:dp[i][j] = dp[i+1][j] + dp[i][j-1] - dp[i+1][j-1] + is[i][j]。

# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
char s[5003];
ll dp[5003][5003];
short is[5003][5003];
int main()
{
    int n, a, b;
    scanf("%s",s+1);
    int len = strlen(s+1);
    for(int i=1; i<=len; ++i) is[i][i] = is[i][i-1] = dp[i][i] = 1;
    for(int i=2; i<=len; ++i)
    {
        for(int j=1; j+i-1<=len; ++j)
        {
            is[j][j+i-1] = (is[j+1][j+i-2] && s[j]==s[j+i-1]);
            dp[j][j+i-1] = dp[j+1][j+i-1] + dp[j][j+i-2] - dp[j+1][j+i-2] + is[j][j+i-1];
        }
    }
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d%d",&a,&b);
        printf("%I64d\n",dp[a][b]);
    }
    return 0;
}