Robot

The robot starts at $(0, 0)$ on a coordinate plane and faces north (the direction of increasing $y$). You program it with a sequence of commands $d_1, d_2, \ldots, d_n$. When the robot is switched on, it performs moves in order. Move $i$ (for $i \ge 1$) drives forward $d_{((i-1) \bmod n)+1}$ units, then turns 90 degrees to the right.

The battery lasts for $t$ seconds. Driving one unit takes 1 second, and each 90 degree turn takes 1 second.

Given a point $(x, y)$, count how many times the robot is at that point before the battery runs out.

The first line contains two integers $n$ and $t$ ($1 \le n \le 100000$, $1 \le t \le 10^{18}$), the length of the robot's program and the battery time in seconds. The second line contains $n$ integers $d_1, \ldots, d_n$ ($1 \le d_i \le 10^9$), the commands in order. The third line contains two integers $x$ and $y$ ($-10^9 \le x, y \le 10^9$), the point being queried.

Print one integer: the number of moments at which the robot is at the point $(x, y)$. A moment at time 0 or at time $t$ counts too.

In the sample, the robot is at the point $(3, 2)$ at 6 and 22 seconds after it is switched on. The figure below shows the robot's route.