#include <bits/stdc++.h>
using namespace std;
#define int long long
int m,n,x;
const int maxn = 1e5+10 ;
vector<int> a(maxn) ;
struct node{
    int id,c ;
    bool operator<(const node y)const
    {
        if(c==y.c)
            return a[id] > a[y.id] ;
        return c>y.c ;
    }
};
signed main(){
    cin >> m >> n >> x ;
    priority_queue<node>q ;
    for(int i = 1 ; i <= n ; i++)
    {
        int y ; cin >> y ; a[i] = y ;
        q.push((node{i,y})) ;
    }
    if(m<n){
        priority_queue<node>q2 ;
        for(int i = 1 ; i <= m ; i++)
            q2.push(q.top()),q.pop() ;
        q = q2 ;
    }
    int ans = 0 ;
    int rest = max(m-n,0ll) ;
    while(1){
        node now = q.top() ;
      //  cout<<now.id<<" "<<now.c<<" "<<a[now.id]<<endl ;
        if(now.c>x)break ;
        q.pop() ;
        if(rest<=0){
            continue ;
        }
        rest-- ;
        now.c+=a[now.id] ;
        q.push(now) ;
    }
    ans = q.size() ;
    while(!q.empty()){
        node now = q.top() ; 
        if(now.c - a[now.id]==x)ans-- , rest++ ;
        q.pop() ;
    }
    cout<<rest<<" "<<ans<<endl ;
    return 0 ;
}