You've got a string *s* = *s*<sub class="lower-index">1</sub>*s*<sub class="lower-index">2</sub>... *s*<sub class="lower-index">|*s*|</sub> of length |*s*|, consisting of lowercase English letters. There also are *q* queries, each query is described by two integers *l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub> (1 ≤ *l*<sub class="lower-index">*i*</sub> ≤ *r*<sub class="lower-index">*i*</sub> ≤ |*s*|). The answer to the query is the number of substrings of string *s*[*l*<sub class="lower-index">*i*</sub>... *r*<sub class="lower-index">*i*</sub>], which are palindromes.

String *s*[*l*... *r*] = *s*<sub class="lower-index">*l*</sub>*s*<sub class="lower-index">*l* + 1</sub>... *s*<sub class="lower-index">*r*</sub> (1 ≤ *l* ≤ *r* ≤ |*s*|) is a substring of string *s* = *s*<sub class="lower-index">1</sub>*s*<sub class="lower-index">2</sub>... *s*<sub class="lower-index">|*s*|</sub>.

String *t* is called a palindrome, if it reads the same from left to right and from right to left. Formally, if *t* = *t*<sub class="lower-index">1</sub>*t*<sub class="lower-index">2</sub>... *t*<sub class="lower-index">|*t*|</sub> = *t*<sub class="lower-index">|*t*|</sub>*t*<sub class="lower-index">|*t*| - 1</sub>... *t*<sub class="lower-index">1</sub>.
The first line contains string *s* (1 ≤ |*s*| ≤ 5000). The second line contains a single integer *q* (1 ≤ *q* ≤ 10<sup class="upper-index">6</sup>) — the number of queries. Next *q* lines contain the queries. The *i*-th of these lines contains two space-separated integers *l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub> (1 ≤ *l*<sub class="lower-index">*i*</sub> ≤ *r*<sub class="lower-index">*i*</sub> ≤ |*s*|) — the description of the *i*-th query.

It is guaranteed that the given string consists only of lowercase English letters.
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
    string s;
    cin >> s;
    int n = s.length();

    vector<vector<int>> is_sub(n+1, vector<int>(n+1, 0));

    for(int i = 1; i < n+1; i++) is_sub[i][i] = 1;
    for(int i = 1; i < n; i++)
        if(s[i-1] == s[i]) is_sub[i][i+1] = 1;

    int j;
    for(int l = 3; l < n+1; l++){
        for(int i = 1; i < n - l + 2; i++){
            j = i + l  - 1;
            if(j < n + 1) is_sub[i][j] = is_sub[i+1][j-1] && (s[i-1] == s[j-1]);
        }
    }

    for(int i = 0; i < n+1; i++)
        for(int j = 1; j < n+1; j++) is_sub[i][j] += is_sub[i][j-1];
    
    for(int j = 0; j < n+1; j++)
        for(int i = 1; i < n+1; i++) is_sub[i][j] += is_sub[i-1][j];
    

    int q, x, y;
    
    cin >> q;
    for(int i = 0; i < q; i++){
        cin >> x >> y;
        cout << is_sub[y][y] + is_sub[x-1][x-1] - is_sub[x-1][y] - is_sub[y][x-1] << endl;
    }

    return 0;
}
