#### Eat Banana For Good Health

**Author: ** Efat Sikder

Problem Setter:Tanvir Ahmed KhanMember, IUBAT IITS Programming Club

Minion Chef has a craving for bananas. She has a collection of ** N** piles of bananas in front of her. Each pile

*i (1 ≤ i ≤ N)*contains

**bananas.**

*A*_{i}Chef's mother, concerned about her health, wants her to finish eating all the bananas. She is currently out of the house and will return in ** H** hours. Chef wants to ensure she has consumed all the bananas before her mother's return.

Chef has an eating speed of ** K** bananas per hour. Each hour, she selects a pile of bananas. If the pile contains at least

**bananas, she eats**

*K***bananas from it. Otherwise, she consumes the entire pile and stops eating for the rest of the hour.**

*K*Chef wants to eat as slowly as possible while still ensuring she finishes all the bananas before her mother returns. Help Chef determine the minimum value of K that guarantees she consumes all the bananas within ** H** hours.

#### Input Format

- The first line of the input contains a single integer
denoting the number of*T**test case*s. - The description of
test cases follows.*T*

- The first line of each test case contains two space-separated integers
and*N*denoting the number of piles and the number of hours after which Chef's mom will come home.*H* - The second line contains
space-separated integers*N**A*_{1}, A_{2}, ..., A_{N}.

#### Constrains:

*1 ≤ T ≤ 10**1 ≤ N ≤ 10*^{5}*N ≤ H ≤ 10*^{9}*1 ≤ A*_{i}≤ 10^{9}**for each valid***i*

#### Output Format

For each test case, print a single line containing one integer — the minimum possible value of ** K**.

#### Samples

###### Input

###### Output

Language | Time | Memory |

GNU C 11 | 1s | 512MB |

GNU C++ 14 | 1s | 512MB |

GNU C++ 11 | 1s | 512MB |