PROGRAMMING:Garden

CLS wants to water his garden. The length of the garden can be replaced by K. CLS has n buckets in his hand. The I bucket allows CLS to water a continuous AI length garden accurately every hour. CLS can't water any part he has already watered. Of course, the scope of watering can't exceed the length of the garden
CLS has to select one of the buckets to water the garden as soon as possible (as mentioned above, once he selects the ith bucket, he will use the ith bucket to water the continuous part of AI every hour). Help her determine the minimum time it takes to water the entire garden. It is guaranteed that CLS can always choose a bucket to water the garden
###Input format:
The input of the first line contains two integers n and K (1 = < n, k = < 100) - representing the number of buckets and the total length of the garden respectively
The input in the second line contains n integers AI (1 = < AI = < 100) - representing the length of the i-th bucket per hour
The problem is to ensure that there is at least one bucket that can water the whole garden in an integer time
###Output format:
Output the shortest time needed to water the whole garden
###Input example:
Input sample 1
```in
3 6
2 3 5
```
Input sample 2
```in
6 7
1 2 3 4 5 6
```
###Output example:
Output sample 1
```out
two
```
Output sample 2
```out
seven
```






answer：If there is no answer, please comment