#include <bits/stdc++.h>

#define DEBUG
#ifdef DEBUG
#define debug(x) cerr << #x << ": " << (x) << endl
#define print(x) cerr << x << ' '
#define println(x) cerr << x << endl
#else
#define debug(x)
#define print(x)
#define println(x)
#endif
#define x first
#define y second
#define el '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

void solve(int m, int n, int x) {
    vector<int> c(n);
    priority_queue<pii, vector<pii>, greater<pii>> Q;
    for (int i = 0; i < n; ++i) cin >> c[i];
    sort(c.begin(), c.end());
    for (int i = 0; i < n; ++i) 
        if (Q.size() < m) 
            Q.emplace(c[i], c[i]);
    int cnt = 0, cnt2 = 0;
    while (Q.size()) {
        auto[t, c] = Q.top(); Q.pop();
        if (t <= x) ++cnt;
        else ++cnt2;
        if (t < x && cnt + cnt2 + Q.size() < m) 
            Q.emplace(t + c, c);
    }
    cout << m - cnt - cnt2 << ' ' << cnt2 << el;
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    // int tcase = 1;
    // cin >> tcase;
    int m, n, x;
    while (cin >> m >> n >> x) solve(m, n, x);
}