{"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\"\u003eRecently, Yiwen is learning Assembly Language.\u003cbr\u003e\u003cbr\u003eSince Yiwen is a genius in computer science, he proposed an extremely valuable technique called Basic Instruction Technology. Using this kind of technique, Yiwen can create numerous different instruction. Some of these instruction can be used to calculate some special eigenvalue of a string, such as $sqc$.\u003cbr\u003e\u003cbr\u003eFor a string $s$, let $s_i$ be the $i^{th}$ character of it.\u003cbr\u003e\u003cbr\u003eInstruction sqc has 4 operands $s$, $l$, $r$ and $c$, where $s$ is a string, $1 \\leq l \\leq r \\leq n$, $c$ is a character represented by ASCII value. $sqc(s,l,r,c)$ returns the number of character $c$ in substring $s_l \\cdots s_r$. \u003cbr\u003e\u003cbr\u003eYiwen wants you to calculate following expression for the given string $s$: $$\\sum_{c\u003d97}^{122}\\sum_{i\u003d1}^{n}\\sum_{j\u003di}^{n} sqc(s,i,j,c)^2$$\u003cbr\u003e\u003cbr\u003eNote that the ASCII value of \u0027a\u0027 is $97$ and the ASCII value of \u0027z\u0027 is $122$.\u003cbr\u003e\u003cbr\u003eThe answer will probably be very huge, so just calculate the answer modulo $998244353$.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The input consists of multiple test cases. \u003cbr\u003e\u003cbr\u003eThe first line contains an integer $T$ ($1 \\leq T \\leq 100$) -- the number of test cases.\u003cbr\u003e\u003cbr\u003eFor each test case, the only line contains a string $s$ ($|s| \\leq 10^5$) consists of lowercase English letters.\u003cbr\u003e\u003cbr\u003eIt is guaranteed that the sum of $|s|$ over all test cases does not excceed $5 \\times 10^6$.\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"For each test case, output your answer modulo $998244353$ in a single line.\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\u003e5\r\nababa\r\na\r\nabcdefga\r\nafidhehfhd\r\nggggggggggg\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e57\r\n1\r\n122\r\n328\r\n1716\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}