跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2627. Queries for Number of Palindromes

  • ID: 2633
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 动态规划
  • 哈希
  • 字符串
  • 数据结构
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Queries for Number of Palindromes

题目描述

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


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2285 题。保留原作者与原赛事署名。