<? echo $row['title']." - ".$MSG_PROBLEM."

Time Limit: 2 sec / Memory Limit: 1024 MB

Score :

300

points

We have a sequence of

N

positive integers:

A=(A_1,\dots,A_N)

.
Let

B

be the concatenation of

10^{100}

copies of

A

.
Consider summing up the terms of

B

from left to right. When does the sum exceed

X

for the first time?
In other words, find the minimum integer

k

such that:

\displaystyle{\sum_{i=1}^{k} B_i \gt X}

Input is given from Standard Input in the following format:

 $N$  $A_1$  $\ldots$  $A_N$  $X$

Print the answer.