{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eA string is palindromic if it reads the same from left to right.\u003cbr\u003eGiven a string $S[1..n]$, Little Q will ask you $m$ queries. For each query, Little Q will give you $2$ integers $l_i,r_i$, you need to find the number of ways to cut the continous substring $S[l_i..r_i]$ into two non-empty palindromic strings. That is, find the number of $k(l_i\\leq k\u0026lt;r_i)$ satisfying $S[l_i..k]$ and $S[k+1..r_i]$ are both palindromic strings.\u003cbr\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line of the input contains an integer $T(1\\leq T\\leq10)$, denoting the number of test cases.\u003cbr\u003eIn each test case, there are $2$ integers $n,m(2\\leq n\\leq 100000,1\\leq m\\leq 100000)$ in the first line, denoting the length of $S$ and the number of queries.\u003cbr\u003eIn the next line, there is a string $S$ consists of $n$ lower-case English letters.\u003cbr\u003eThen in the following $m$ lines, there are $2$ integers $l_i,r_i(1\\leq l_i\u0026lt;r_i\\leq n)$ in each line, denoting a query.\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"For each query, print a single line containing an integer, denoting the answer.\u003cbr\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e1\r\n10 5\r\naaaabababb\r\n1 4\r\n1 5\r\n4 9\r\n6 10\r\n1 10\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e3\r\n1\r\n3\r\n1\r\n0\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}