#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
typedef pair<int,int> pii;
typedef pair<long long ,long long>pll;
#define intmax 100000000
#define se second
#define fi first
#define MOD 1000000007
#define PI 3.1415926535897932385
const long long Nmax=1000000;

bool ispossible(ll arr[],ll k,ll n,ll h){
    ll temp=0;
    for(int i=0;i<n;i++){
        temp+=ceil(((long double)arr[i])/k);
    }
    if(temp<=h)
        return true;
    return false;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    
    int t;
    cin>>t;
    while(t--){
        ll n,h;
        cin>>n>>h;
        ll arr[n];
        ll sum=0;
        ll alpha=0;
        for(int i=0;i<n;i++){
            cin>>arr[i];
            sum+=arr[i];
            alpha=max(alpha,arr[i]);
        }
        ll ans=sum+100;
        ll l=1;
        ll r=alpha;
        while(l<=r){
            ll mid=(l+r)/2ll;
            if(ispossible(arr,mid,n,h)){
                ans=min(mid,ans);
                r=mid-1;
            }
            else l=mid+1;
        }
        cout<<ans<<endl;
    }
    return 0;    
}