{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\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 type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eLucida has a sequence of $$$n$$$ integers $$$a_1, a_2, \\dots, a_n$$$. He asks you to perform two types of operations for him, which are described as follows:\u003c/p\u003e\u003cp\u003e1. \u003cspan class\u003d\"tex-font-style-tt\"\u003e1 L R\u003c/span\u003e, add $$$lowbit(a_i)$$$ to each $$$a_i$$$ in the interval $$$[L, R]$$$.\u003c/p\u003e\u003cp\u003e2. \u003cspan class\u003d\"tex-font-style-tt\"\u003e2 L R\u003c/span\u003e, query the sum of the numbers in the interval $$$[L, R]$$$.\u003c/p\u003e\u003cp\u003e$$$lowbit(x)$$$ is defined as the largest power of 2 that divides $$$x$$$. For example, lowbit(4)\u003d4, lowbit(5)\u003d1. Specially, lowbit(0)\u003d0.\u003c/p\u003e\u003cp\u003eLucida wants you to give the answer modulo $$$998244353$$$ for each of his queries.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThis problem contains multiple test cases.\u003c/p\u003e\u003cp\u003eThe first line contains a single integer $$$T$$$ ($$$1\\leq T \\leq 20$$$) indicating the number of test cases.\u003c/p\u003e\u003cp\u003eFor each case, the first line contains an integer $$$n$$$ ($$$1 \\leq n \\leq 10^5$$$), the length of the sequence.\u003c/p\u003e\u003cp\u003eThe next line contains $$$n$$$ integers $$$a_i$$$ ($$$1 \\leq a_i \u0026lt; 998244353$$$) separated by spaces, representing the sequence.\u003c/p\u003e\u003cp\u003eThe next line contains an integer $$$m$$$ ($$$1 \\leq m \\leq 10^5$$$), the number of operations.\u003c/p\u003e\u003cp\u003eThe next $$$m$$$ lines, each line contains 3 integers $$$op, L, R$$$ ($$$1 \\leq op \\leq 2$$$, $$$1 \\leq L \\leq R \\leq n$$$), represents one operation. The specific meaning is described above.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each query, output a line contains the answer modulo $$$998244353$$$.\u003c/p\u003e"}},{"title":"Examples","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\n5\n1 2 3 4 5\n5\n2 2 4\n1 1 3\n2 2 4\n1 1 5\n2 4 5\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e9\n12\n14\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}