I Wanna Win The Game

AtCoder

IDarc116_d

Time2000ms

Memory256MB

Difficulty—

Given are integers $N$ and $M$. How many sequences $A$ of $N$ integers satisfy the following conditions? * $0 \leq A_i \left(i = 1, 2, \ldots, N\right)$ * $\sum_{i = 1}^{N} A_i = M$ * $A_1$ xor $A_2$ xor $\cdots$ xor $A_N = 0$ ("xor" denotes the bitwise XOR.) Since the answer can be enormous, report it modulo $998244353$. ## Constraints * All values in input are integers. * $1 \leq N \leq 5000$ * $1 \leq M \leq 5000$ ## Input Input is given from Standard Input in the following format: $N$ $M$ [samples]

Samples

Input #1

5 20

Output #1

475

Some of the sequences $A$ satisfying the conditions follow:

*   $A = \left(10, 0, 10, 0, 0\right)$
*   $A = \left(1, 2, 3, 7, 7\right)$

Input #2

10 5

Output #2

Input #3

3141 2718

Output #3

371899128

API Response (JSON)

{
  "problem": {
    "name": "I Wanna Win The Game",
    "description": {
      "content": "Given are integers $N$ and $M$. How many sequences $A$ of $N$ integers satisfy the following conditions? *   $0 \\leq A_i \\left(i = 1, 2, \\ldots, N\\right)$ *   $\\sum_{i = 1}^{N} A_i = M$ *   $A_1$ xor",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "arc116_d"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given are integers $N$ and $M$. How many sequences $A$ of $N$ integers satisfy the following conditions?\n\n*   $0 \\leq A_i \\left(i = 1, 2, \\ldots, N\\right)$\n*   $\\sum_{i = 1}^{N} A_i = M$\n*   $A_1$ xor...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments