• 216通过
• 323提交
• 题目来源
• 评测方式 RemoteJudge
• 标签 模拟
• 难度 入门难度
• 时空限制 2000ms / 256MB
• 提示：收藏到任务计划后，可在首页查看。

## 题意翻译

【题目大意】 最近Luba买了一本书，他希望在接下来的$n$ 天里抽出$t$ 秒看完这本书。（总计$t$ 秒） 但是Luba每天会有一些工作，对于第$i$天，他需要花费$a_i$ 秒时间来工作。 问Luba最早在什么时候能看完这本书。（注意一天有$86400$ 秒）

【输入格式】 第一行两个数字$n$ 和$t$ 接下来一行共$n$个数字代表$a_i$

【输出格式】 一行仅一个数$x$ ，表示Luba最早在第$x$ 天能看完书。 数据保证答案$\leq n$ 。 Translated by @Durant_Lee

## 题目描述

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_{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.

## 输入输出格式

输入格式：

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.

输出格式：

Print the minimum day Luba can finish reading the book.

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

## 输入输出样例

输入样例#1： 复制
2 2
86400 86398

输出样例#1： 复制
2

输入样例#2： 复制
2 86400
0 86400

输出样例#2： 复制
1

提示
标程仅供做题后或实在无思路时参考。
请自觉、自律地使用该功能并请对自己的学习负责。
如果发现恶意抄袭标程，将按照I类违反进行处理。