{"problem":{"name":"Jumping sequence","description":{"content":"Consider an infinite two-dimensional coordinate plane. Takahashi, who is initially standing at $(0,0)$, will do $N$ jumps in one of the four directions he chooses every time: up, down, left, or right.","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":5000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc221_g"},"statements":[{"statement_type":"Markdown","content":"Consider an infinite two-dimensional coordinate plane. Takahashi, who is initially standing at $(0,0)$, will do $N$ jumps in one of the four directions he chooses every time: up, down, left, or right. The length of each jump is fixed. Specifically, the $i$\\-th jump should cover the distance of $D_i$. Determine whether it is possible to be exactly at $(A, B)$ after $N$ jumps. If it is possible, show one way to do so.\nHere, for each direction, a jump of length $D$ from $(X, Y)$ takes him to the following point:\n\n*   up: $(X,Y) \\to (X,Y+D)$\n*   down: $(X,Y) \\to (X,Y-D)$\n*   left: $(X,Y) \\to (X-D,Y)$\n*   right: $(X,Y) \\to (X+D,Y)$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 2000$\n*   $\\lvert A\\rvert, \\lvert B\\rvert \\leq 3.6\\times 10^6$\n*   $1 \\leq D_i \\leq 1800$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $A$ $B$\n$D_1$ $D_2$ $\\ldots$ $D_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc221_g","tags":[],"sample_group":[["3 2 -2\n1 2 3","Yes\nLDR\n\nIf he jumps left, down, right in this order, Takahashi moves $(0,0)\\to(-1,0)\\to(-1,-2)\\to(2,-2)$ and ends up at $(2, -2)$, which is desired."],["2 1 0\n1 6","No\n\nIt is impossible to be exactly at $(1, 0)$ after the two jumps."],["5 6 7\n1 3 5 7 9","Yes\nLRLUR"]],"created_at":"2026-03-03 11:01:14"}}