{"trustable":false,"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":"有n个学生打羽毛球,其中有a个人没拍没球,b个人只有拍,c个人只有球,d个人有拍有球。 \n现在要求选出几个人组织一场比赛,一共有2^n种情况,组织成功的条件是至少有2个拍1个球。求有多少种情况无法组织成功。"}},{"title":"Input","value":{"format":"HTML","content":"The first line contains a single number $t(1 \\leq t \\leq 10^3)$, the number of testcases. \n\u003cbr\u003e \n\u003cbr\u003eFor each testcase, the first line contains four integers $a,b,c,d(0 \\leq a,b,c,d \\leq 10^7,a+b+c+d \\geq 1)$."}},{"title":"Output","value":{"format":"HTML","content":"For each testcase, output a single line with a single integer, the answer modulo $998244353$."}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e3\n1 1 1 1\n2 2 2 2\n3 4 5 6\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e12\n84\n2904\u003c/pre\u003e"}}]}