#include<bits/stdc++.h>
#define pb push_back
#define sz(x) (int)(x).size()
#define f first
#define s second
#define ll long long
using namespace std;

const int N=2e5+5;
map<int,bool> done;
__float128 best=LLONG_MAX;
pair<int,int> kad;
void calc(int x,int y,vector<ll> &h){
    if(x<1||y<1)return;
    if(done[x])return;
    done[x]=1;
    ll ans=0;
    for(auto p:h){
        ll tr=p/x;
        if(p%x)tr++;
        ans+=tr;
    }
    __float128 aa=(__float128)ans/y;
    if(aa<best){
        best=aa;
        kad={x,y};
    }
}
int main(){
    ll tm=clock();
    int n,k;
    scanf("%i %i",&n,&k);
    vector<ll> h(n);
    sort(h.begin(),h.end());
    for(int i=0;i<n;i++){
        scanf("%lld",&h[i]);
    }
    int x1=k/2,y1=k-x1;
    for(int i=-100;i<=100;i++){
        int x=x1+i,y=y1-i;
        if(x>=1&&y>=1&&x<k&&y<k){
            calc(x,y,h);
        }
    }
    for(int i=0;i<=300;i++){
        if(i>n)break;
        int x=min((ll)k-1,h[n-1-i]);
        calc(x,k-x,h);
    }
    for(int p=0;p<1000;p++){
        int tr=rand()%n;
        int x=min((ll)k-1,h[tr]);
        int mv=rand()%1000;
        x+=mv-50;
        calc(x,k-x,h);
    }

    printf("%i %i\n",kad.f,kad.s);
}