#include "bits/stdc++.h"


using namespace std;
using i64 = long long;

const i64 mod = 1e9 + 7;
const i64 inf = 1e18;
#define endl '\n'


void solve() {

}

int main() {
    int n, m, x;
    while (cin >> m >> n >> x) {
        vector<int> v(n + 1);
        int left = m;
        // 结束时间 速度
        priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> q;
        for (int i = 1; i <= n; i++) {
            cin >> v[i];
            q.push({0, v[i]});
        }
        while (!q.empty()) {
            if (q.top().first >= x) {
                break;
            }
            if (left == 0) {
                break;
            }
            auto [t, s] = q.top();
            q.pop();
            q.emplace(t + s, s);
            left--;
        }
        while (!q.empty() && q.top().first <= x) {
            q.pop();
        }
        cout << left << " " << q.size() << endl;


    }
    return 0;
}