#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){

    ll N, K, ans=0;
    cin >> N >> K;
    vector<ll> A(N);
    for (int i=0; i<N; i++) cin >> A[i];
    sort(A.begin(), A.end());
    for (int i=0; i<N; i++){
        if (A[i] <= K){
            K -= A[i];
            ans++;
        }
    }

    cout << ans << " " << K << endl;

    return 0;
}