#include <bits/stdc++.h>
using namespace std;
struct cat
{
    int tim, speed;
    friend bool operator<(const cat &a, const cat &b)
    {
        if (a.tim == b.tim)
        {
            return a.speed > b.speed;
        }
        return a.tim > b.tim;
    }
};
void solve()
{
    int m, n, x;
    cin >> m >> n >> x;
    vector<int> t(n);
    priority_queue<cat> q;
    for (int i = 1; i <= n; i++)
    {
        cin >> t[i - 1];
    }
    sort(t.begin(), t.end());
    int n1 = 0, n2 = 0;
    for (int i = 1; i <= min(m, n); i++)
    {
        q.push({t[i - 1], t[i - 1]}), n2++;
    }

    m -= min(n, m);
    int fore = 0;
    for (int i = 1; i <= x; i++)
    {
        m -= fore;
        n2 += fore;
        fore = 0;
        while (q.top().tim <= i)
        {
            auto [tim, speed] = q.top();
            q.pop();
            n1++, n2--;
            if (m - fore != 0)
                q.push({tim + speed, speed}), fore++;
        }
    }
    cout << m << " " << n2 << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T--)
        solve();
}