{"problem":{"name":"Count Sequences","description":{"content":"Find the number of sequences of integers with $N$ terms, $A=(a_1,a_2,\\ldots,a_N)$, that satisfy the following conditions, modulo $998244353$. *   $0 \\leq a_1 \\leq a_2 \\leq \\ldots \\leq a_N \\leq M$. * ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":4000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc276_g"},"statements":[{"statement_type":"Markdown","content":"Find the number of sequences of integers with $N$ terms, $A=(a_1,a_2,\\ldots,a_N)$, that satisfy the following conditions, modulo $998244353$.\n\n*   $0 \\leq a_1 \\leq a_2 \\leq \\ldots \\leq a_N \\leq M$.\n*   For each $i=1,2,\\ldots,N-1$, the remainder when $a_i$ is divided by $3$ is different from the remainder when $a_{i+1}$ is divided by $3$.\n\n## Constraints\n\n*   $2 \\leq N \\leq 10^7$\n*   $1 \\leq M \\leq 10^7$\n*   All values in the input are integers.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$ $M$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc276_g","tags":[],"sample_group":[["3 4","8\n\nHere are the eight sequences that satisfy the conditions.\n\n*   $(0,1,2)$\n*   $(0,1,3)$\n*   $(0,2,3)$\n*   $(0,2,4)$\n*   $(1,2,3)$\n*   $(1,2,4)$\n*   $(1,3,4)$\n*   $(2,3,4)$"],["276 10000000","909213205\n\nBe sure to find the count modulo $998244353$."]],"created_at":"2026-03-03 11:01:13"}}