#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
#define fi first
#define se second
int n,k;
ll h[200005];
pair<ll,ll>b={1e18,1};
int ans=0;
bool cmp(pll c1,pll c2){
    if(c1.fi/c1.se!=c2.fi/c2.se) return c1.fi/c1.se<c2.fi/c2.se;
    c1.fi%=c1.se;
    c2.fi%=c2.se;
    return c1.fi*c2.se<c2.fi*c1.se;
}
ll dx[200005];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    ll frog=0;
    for(int i=1; i<=n ;i++){
        cin >> h[i];
        frog+=sqrt(h[i]);
    }
    if(frog>=2.5e8){
        for(ll i=k/2-3000; i<=k/2+3000 ;i++){
            if(i<1 || i>=k) continue;
            ll c1=0,c2=k-i;
            for(int j=1; j<=n ;j++) c1+=(h[j]+i-1)/i;
            if(!cmp(b,{c1,c2})){
                b={c1,c2};
                ans=i;
            }
        }
        cout << ans << ' ' << k-ans << '\n';
        return 0;
    }
    for(int i=1; i<=n ;i++){
        ll prv=0;
        ll x=h[i];
        int cur=1;
        for(int j=1; j<k ;){
            ll cur=(x-1)/j+1;
            dx[j]+=cur-prv;
            prv=cur;
            if(j>=x) break;
            j=(x-1)/((x-1)/(j))+1;
        }
    }
    for(int i=1; i<k ;i++){
        int j=i;
        dx[j]+=dx[j-1];
        ll c1=dx[j];
        ll c2=k-i;
        //cout << i << ' ' << dx[j] << endl;
        if(!cmp(b,{c1,c2})){
            b={c1,c2};
            ans=i;
        }
    }
    cout << ans << ' ' << k-ans << '\n';
}