Step Up Robot

AtCoder

IDabc289_d

Time2000ms

Memory256MB

Difficulty—

There is a staircase with infinite steps. The foot of the stairs is the $0$\-th step, the next step is the $1$\-st step, the next is the $2$\-nd, and so on. There is a stair-climbing robot on the $0$\-th step. The robot can climb up $A _ 1,A _ 2,\ldots$, or $A _ N$ steps at a time. In other words, when the robot is on the $i$\-th step, it can step onto one of the $(i+A _ 1)$\-th step, $(i+A _ 2)$\-th step, $\ldots$, and $(i+A _ N)$\-th step, but not onto the others in a single step. The robot cannot descend the stairs, either. There are traps on the $B _ 1$\-th, $B _ 2$\-th, $\ldots$, and $B _ M$\-th steps. Once the robot steps onto a step with a trap, it cannot move anymore. The robot wants to step onto the $X$\-th step. Determine whether it is possible to do so. ## Constraints * $1\leq N\leq10$ * $1\leq A _ 1\lt A _ 2\lt\cdots\lt A _ N\leq10^5$ * $1\leq M\leq10^5$ * $1\leq B _ 1\lt B _ 2\lt\cdots\lt B _ M\lt X\leq10^5$ * All values in the input are integers. ## Input The input is given from Standard Input in the following format: $N$ $A _ 1$ $A _ 2$ $\ldots$ $A _ N$ $M$ $B _ 1$ $B _ 2$ $\ldots$ $B _ M$ $X$ [samples]

Samples

Input #1

Output #1

Yes

For example, the robot can reach the $15$\-th step as follows.

*   Climb up $3$ steps. The robot is now on the $3$\-rd step.
*   Climb up $4$ steps. The robot is now on the $7$\-th step.
*   Climb up $5$ steps. The robot is now on the $12$\-th step.
*   Climb up $3$ steps. The robot is now on the $15$\-th step.

Input #2

Output #2

No

No matter how the robot moves, it cannot step onto the $8$\-th step.

Input #3

4
2 5 7 8
5
2 9 10 11 19
20

Output #3

Yes

API Response (JSON)

{
  "problem": {
    "name": "Step Up Robot",
    "description": {
      "content": "There is a staircase with infinite steps. The foot of the stairs is the $0$\\-th step, the next step is the $1$\\-st step, the next is the $2$\\-nd, and so on. There is a stair-climbing robot on the $0$\\",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc289_d"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "There is a staircase with infinite steps. The foot of the stairs is the $0$\\-th step, the next step is the $1$\\-st step, the next is the $2$\\-nd, and so on.\nThere is a stair-climbing robot on the $0$\\...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments