Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Book Reading

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputRecently Luba bought a very interesting book. She knows that it will take *t* seconds to read the book. Luba wants to finish reading as fast as she can.

But she has some work to do in each of *n* next days. The number of seconds that Luba has to spend working during *i*-th day is *a*_{i}. If some free time remains, she can spend it on reading.

Help Luba to determine the minimum number of day when she finishes reading.

It is guaranteed that the answer doesn't exceed *n*.

Remember that there are 86400 seconds in a day.

Input

The first line contains two integers *n* and *t* (1 ≤ *n* ≤ 100, 1 ≤ *t* ≤ 10^{6}) — the number of days and the time required to read the book.

The second line contains *n* integers *a*_{i} (0 ≤ *a*_{i} ≤ 86400) — the time Luba has to spend on her work during *i*-th day.

Output

Print the minimum day Luba can finish reading the book.

It is guaranteed that answer doesn't exceed *n*.

Examples

Input

2 2

86400 86398

Output

2

Input

2 86400

0 86400

Output

1

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/20/2019 00:27:12 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|