#include<bits/stdc++.h>
using namespace std;
int m,n,x;
void Solve(){
    vector<int> c(n+1);
    for (int i = 1; i <= n; ++i){
        cin >> c[i];
    }
    sort(c.begin()+1,c.end());
    vector<int> timeend(n+1,0);
    for (int nowtime = 0; nowtime <= x-1; ++nowtime){
        for (int i = 1; i <= n; ++i){
            if (timeend[i] == nowtime){
                if (m > 0) {m--; timeend[i] += c[i];}
            }
        }
    }
    int cnt = 0;
    for (int i = 1; i <= n; ++i){
        if (timeend[i] > x) cnt++;
    }
    cout << m << " " << cnt << "\n";
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    while(cin>>m>>n>>x)
        Solve();  
    return 0;  
}
/*
2	1	1
1
8	3	5
1	3	4
4	5	1
5	4	3	2	1
*/