PROGRAMMING:The candy problem of JYF
JYF has a hamster named Mantou, especially Mantou, who likes to eat candy very much, so JYF will give Mantou a certain amount of candy every day, but the candy eaten by Mantou every day can't exceed 8 (otherwise it will be GG). How many days does it take to eat K candies in steamed bread.
###Input format:
The title gives two lines of data, the first line input n (1 < = n < = 100), K (1 < = k < = 1000), which means that JYF will go to the store to buy candy in n days, if there is extra candy, JYF will give it to husky next door to eat, the next line gives n numbers AI (AI < = 100), which represents the number of candy JYF buys every day.
###Output format:
If you have eaten K candies, you don't need to eat any more, output t days.
If you can't eat K candies, output - 1.
###Input example:
Here is a set of inputs. For example:
```in
2 3
1 2
```
###Output example:
The corresponding output is given here. For example:
```out
two
```
answer：If there is no answer, please comment
###Input format:
The title gives two lines of data, the first line input n (1 < = n < = 100), K (1 < = k < = 1000), which means that JYF will go to the store to buy candy in n days, if there is extra candy, JYF will give it to husky next door to eat, the next line gives n numbers AI (AI < = 100), which represents the number of candy JYF buys every day.
###Output format:
If you have eaten K candies, you don't need to eat any more, output t days.
If you can't eat K candies, output - 1.
###Input example:
Here is a set of inputs. For example:
```in
2 3
1 2
```
###Output example:
The corresponding output is given here. For example:
```out
two
```
answer：If there is no answer, please comment