#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cstring>
#include <iomanip>
#include <unordered_map>
#include <numeric>
 
#define sc_int(x) scanf("%d", &x)
 
#define x first
#define y second
#define pb push_back

using namespace std;

const int N = 1010, M = 50, MOD = 1e9 + 7;
const int inf = 1e9;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef pair<char, int> PCI;
typedef pair<string, string> PSS;

int n, m, x;

void solve() 
{
    vector<int> a(n);
    for(auto &t : a) cin >> t;
    vector<int> ed(n);
    sort(a.begin(), a.end());
    int ans1 = m, ans2 = 0;
    map<int, int> v;
    for(int i = 1; i <= x; i ++)
    {
        if(ans1 == 0 && ans2 == 0) break;
        for(int j = 0; j < n; j ++)
        {
            if(ed[j] == a[j]) ans2 --, ed[j] = 0, v[j] = 0;
            if(!ed[j] && ans1) ans1 --, ans2 ++, v[j] = 1;
            if(v[j]) ed[j] ++;
        }
    }
    for(int i = 0; i < n; i ++)
    {
        if(ed[i] == a[i]) ans2 --;
    }
    cout << ans1 << " " << ans2 << endl;
}


int main()
{
//  freopen("input.txt","r",stdin);
//  freopen("output.txt","w",stdout);
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    
    int T = 1;
    // cin >> T;
    while(cin >> m >> n >> x)
    {
        solve();
    }
}