Recently 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*<sub class="lower-index">*i*</sub>. 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.
The first line contains two integers *n* and *t* (1 ≤ *n* ≤ 100, 1 ≤ *t* ≤ 10<sup class="upper-index">6</sup>) — the number of days and the time required to read the book.

The second line contains *n* integers *a*<sub class="lower-index">*i*</sub> (0 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 86400) — the time Luba has to spend on her work during *i*-th day.
none
2 2
86400 86398
2
2 86400
0 86400
1
2 86400
1 86399
2
100 1000000
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
12
1 1
86399
1
6 1200
86400 86400 86000 86000 86000 86400
5
6 1200
86400 86400 86000 86000 86001 86399
6
4 172799
1 1 86400 0
4
4 172799
0 86400 86399 0
4
6 1
1 1 86400 1 86399 1
1
4 1
86400 86399 86400 86400
2
4 1
86400 86400 0 86400
3
n, t = map(int, input().split())

a = list(map(int, input().split()))

x = 0
c = 0

while x < t:
    x += 86400 - a[c]
    c += 1

print(c)
