Codeforces 839A-Arya and Bran

Arya and Bran

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Bran and his older sister Arya are from the same house. Bran like candies so much, so Arya is going to give him some Candies.

At first, Arya and Bran have 0 Candies. There are n days, at the i-th day, Arya finds ai candies in a box, that is given by the Many-Faced God. Every day she can give Bran at most 8 of her candies. If she don't give him the candies at the same day, they are saved for her and she can give them to him later.

Your task is to find the minimum number of days Arya needs to give Bran k candies before the end of the n-th day. Formally, you need to output the minimum day index to the end of which k candies will be given out (the days are indexed from 1 to n).

Print -1 if she can't give him k candies during n given days.

Input

The first line contains two integers n and k (1 ≤ n ≤ 100, 1 ≤ k ≤ 10000).

The second line contains n integers a1, a2, a3, ..., an (1 ≤ ai ≤ 100).

Output

If it is impossible for Arya to give Bran k candies within n days, print -1.

Otherwise print a single integer — the minimum number of days Arya needs to give Bran k candies before the end of the n-th day.

Examples

input

2 31 2

output

2

input

3 1710 10 10

output

3

input

1 910

output

-1

Note

In the first sample, Arya can give Bran 3 candies in 2 days.

In the second sample, Arya can give Bran 17 candies in 3 days, because she can give him at most 8 candies per day.

In the third sample, Arya can't give Bran 9 candies, because she can give him at most 8 candies per day and she must give him the candies within 1 day.

题意：有两个人，在n天中，每天会给一个人a[i]块糖果，这个人会把糖果给另一个人，但最多给8块，问几天后另一个人有k块糖果

解题思路：水题，模拟一下整个过程即可

#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>using namespace std;#define LL long longconst int INF = 0x3f3f3f3f;int main(){    int n,m;    int a[105];    while(~scanf("%d%d",&n,&m))    {        int sum1=0,sum2=0;        for(int i=0; i<n; i++) scanf("%d",&a[i]);        int ans=-1;        for(int i=0; i<n; i++)        {            sum2+=a[i];            if(sum2>=8) sum1+=8,sum2-=8;            else sum1+=sum2,sum2=0;            if(sum1>=m)            {                ans=i+1;                break;            }        }        printf("%d\n",ans);    }    return 0;}