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

#define fi first
#define se second
#define Mp make_pair
#define pb push_back
#define SZ(x) (int((x).size()))

typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef pair<int, int> pii;

void solve() {
    int m, n, x;
    cin >> m >> n >> x;
    vi c(n);
    for(int i = 0; i < n; i++)
        cin >> c[i];
    int eaten = 0, eating = 0;
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    for(int i = 0; i < n; i++) pq.push(Mp(0, c[i]));
    while(SZ(pq)) {
        auto [ti, cc] = pq.top(); pq.pop();
        if(ti > x) break;
        if(ti) eating--;
        if(ti == x) break;
        if(m > 0) {
            pq.push(Mp(ti + cc, cc));
            eating++, m--;
        }
    }
    cout << m << ' ' << eating << '\n';
}
signed main() {
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}