#include <bits/stdc++.h>
#define fr first
#define sc second
#define all(a) (a).begin(), (a).end()
#define unique(a) a.resize(unique(a.begin(), a.end()) - a.begin())

using namespace std;

#ifdef ONPC
mt19937 rnd(223);
#else
mt19937 rnd(chrono::high_resolution_clock::now()
                    .time_since_epoch().count());
#endif

#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

using ll = long long;
using ld = double;

const int maxn = 1e5 + 100, inf = 1e9 + 100;

template<typename T>
using pq = priority_queue<T, vector<T>, greater<T>>;

void solve() {
    int m, n, x;
    cin >> m >> n >> x;
    vector<int> c(n);
    for (int& i : c)
        cin >> i;

    pq<pair<int, int>> q;
    for (int i = 0; i < n; ++i) {
        q.emplace(0, c[i]);
    }

    int ans = 0;
    int ans2 = 0;
    for (int i = 0; i < m; ++i) {
        auto [tm, c] = q.top();
        q.pop();
//        cerr << tm << ' ' << c << endl;
        if (tm + c <= x) {
            ++ans;
        } else if (tm < x) {
            ++ans2;
        }
        q.emplace(tm + c, c);
    }
    cout << m - ans2 - ans << ' ' << ans2 << '\n';
}

int main() {
#ifdef ONPC
    freopen("../a.in", "r", stdin);
//    freopen("../a.out", "w", stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed;
    cout.precision(20);
    solve();
    cerr << "\n\nConsumed " << TIME << endl;
}