{"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\"\u003e Now you are back,and have a task to do:\u003cbr\u003e Given you a string s consist of lower-case English letters only,denote f(s) as the number of distinct sub-string of s.\u003cbr\u003e And you have some query,each time you should calculate f(s[l...r]), s[l...r] means the sub-string of s start from l end at r.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":" The first line contains integer T(1\u0026lt;\u003dT\u0026lt;\u003d5), denote the number of the test cases.\u003cbr\u003e For each test cases,the first line contains a string s(1 \u0026lt;\u003d length of s \u0026lt;\u003d 2000).\u003cbr\u003e Denote the length of s by n.\u003cbr\u003e The second line contains an integer Q(1 \u0026lt;\u003d Q \u0026lt;\u003d 10000),denote the number of queries.\u003cbr\u003e Then Q lines follows,each lines contains two integer l, r(1 \u0026lt;\u003d l \u0026lt;\u003d r \u0026lt;\u003d n), denote a query."}},{"title":"Output","value":{"format":"HTML","content":"For each test cases,for each query,print the answer in one line."}},{"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\u003e2\r\nbbaba\r\n5\r\n3 4\r\n2 2\r\n2 5\r\n2 4\r\n1 4\r\nbaaba\r\n5\r\n3 3\r\n3 4\r\n1 4\r\n3 5\r\n5 5\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e3\r\n1\r\n7\r\n5\r\n8\r\n1\r\n3\r\n8\r\n5\r\n1\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Hint","value":{"format":"HTML","content":"\u003cbr\u003e I won\u0027t do anything against hash because I am nice.Of course this problem has a solution that don\u0027t rely on hash.\u003cbr\u003e"}}]}