{"problem":{"name":"Ex - Odd Sum","description":{"content":"You are given a sequence $A=(A_1,A_2,\\dots,A_N)$ of length $N$. Find the number, modulo $998244353$, of ways to choose an odd number of elements from $A$ so that the sum of the chosen elements equals ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":4000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc267_h"},"statements":[{"statement_type":"Markdown","content":"You are given a sequence $A=(A_1,A_2,\\dots,A_N)$ of length $N$.\nFind the number, modulo $998244353$, of ways to choose an odd number of elements from $A$ so that the sum of the chosen elements equals $M$.\nTwo choices are said to be different if there exists an integer $i (1 \\le i \\le N)$ such that one chooses $A_i$ but the other does not.\n\n## Constraints\n\n*   $1 \\le N \\le 10^5$\n*   $1 \\le M \\le 10^6$\n*   $1 \\le A_i \\le 10$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $M$\n$A_1$ $A_2$ $\\dots$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc267_h","tags":[],"sample_group":[["5 6\n1 2 3 3 6","3\n\nThe following $3$ choices satisfy the condition:\n\n*   Choosing $A_1$, $A_2$, and $A_3$.\n*   Choosing $A_1$, $A_2$, and $A_4$.\n*   Choosing $A_5$.\n\nChoosing $A_3$ and $A_4$ does not satisfy the condition because, although the sum is $6$, the number of chosen elements is not odd."],["10 23\n1 2 3 4 5 6 7 8 9 10","18"]],"created_at":"2026-03-03 11:01:14"}}