{"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\"\u003eVasily Tadokorov is a stringologist. He thinks a string is fragrant if it can be divided into two parts — $\\texttt{nunhehheh}$ as the prefix and a number of (excluding $0$) $\\texttt{a}$ as the suffix. For example, $\\texttt{nunhehhehaaaaaa}$ is fragrant, but $\\texttt{nunhehheh}$ and $\\texttt{nunhehhehoooaaa}$ are not fragrant.\u003cbr\u003e\u003cbr\u003eToday Vasily Tadokorov has some strings consisting of lowercase English letters. For each string, he wants to know how many subsequences of this string are fragrant. A string $a$ is a subsequence of a string $b$ if $a$ can be obtained from $b$ by deletion of several (including $0$) characters.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line contains an integer $T\\ (1 \\leq T \\leq 1000)$, denoting the number of strings.\u003cbr\u003e\u003cbr\u003eEach of the next $T$ lines contains a string $S\\ (1 \\leq |S| \\leq 10^5)$ consisting of lowercase English letters.\u003cbr\u003e\u003cbr\u003eThe total length of the strings in the input will not exceed $10^6$."}},{"title":"Output","value":{"format":"HTML","content":"For each of the given $T$ strings, output the answer modulo $998244353$."}},{"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\nnunhehhehahaahahahahahahaahaahahahahha\r\nnunhehhehhehhahaahahahaahaahahaaaahaa\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e114514\r\n1919810\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}