{"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?? is practicing his program skill, and now he is given a string, he has to calculate the total number of its distinct substrings. \u003cbr\u003eBut ?? thinks that is too easy, he wants to make this problem more interesting. \u003cbr\u003e?? likes a character X very much, so he wants to know the number of distinct substrings which contains at least one X. \u003cbr\u003eHowever, ?? is unable to solve it, please help him.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line of the input gives the number of test cases T;T test cases follow. \u003cbr\u003eEach test case is consist of 2 lines: \u003cbr\u003eFirst line is a character X, and second line is a string S. \u003cbr\u003eX is a lowercase letter, and S contains lowercase letters(‘a’-‘z’) only.\u003cbr\u003e\u003cbr\u003eT\u0026lt;\u003d30 \u003cbr\u003e1\u0026lt;\u003d|S|\u0026lt;\u003d10^5 \u003cbr\u003eThe sum of |S| in all the test cases is no more than 700,000."}},{"title":"Output","value":{"format":"HTML","content":"For each test case, output one line containing “Case #x: y”(without quotes), where x is the test case number(starting from 1) and y is the answer you get for that case.\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\u003e2 \r\na \r\nabc \r\nb \r\nbbb\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase #1: 3 \r\nCase #2: 3\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":"In first case, all distinct substrings containing at least one a: a, ab, abc. \u003cbr\u003eIn second case, all distinct substrings containing at least one b: b, bb, bbb."}}]}