#include <bits/stdc++.h>
using namespace std;

using ll = __int128_t;

const int LIMIT = 1500;

int main() {
    int n, k;
    scanf("%d%d", &n, &k);
    vector<long long> h(n);
    for (auto& i : h) scanf("%lld", &i);;
    int best;
    ll num = 0, denom = 1;
    int small = max(1, k/2 - LIMIT), big = min(k - 1, k/2 + LIMIT);
    for (int i = small; i <= big ; i++) {
        ll hits = 0;
        for (auto j : h) hits += (j + i - 1) / i;
        if (num == 0 || num * (k - i) > hits * denom) {
            num = hits;
            denom = k - i;
            best = i;
        }
    }
    printf("%d %d\n", best, k - best);
}