#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define rep(i,a,n) for (int i = a; i < (n); i++)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
int mod = 998244353;
int INF = 1001001001;
using pll = pair<int,int>;

int Flag=0;

//デフォルトでNoがでる
void yn(int Flag){
  if(Flag==1){
    cout<<"Yes"<<endl;
  }
  else if(Flag==0){
    cout<<"No"<<endl;
  }
  else{
    cout<<"Draw"<<endl;
  }
}

void cerrVec(vector<string> &V){
  int n=V.size();
  rep(i,0,n){
    for(auto x:V[i]){
      cerr<<x<<" ";
    }
    cerr<<endl;
  }
  cerr<<endl;
}

/*
  int H,W; cin>>H>>W;
  vector<vector<char>> C(H,vector<char> (W));
  rep(i,0,H) rep(j,0,W) cin>>C[i][j];
*/

int main(){
  int N,K; cin>>N>>K;
  vector<P> y(N);
  rep(i,0,N){
    cin>>y[i].first;
    y[i].second=i;
  }
  sort(all(y));
  ll sum=0;
  int idx=-1;
  int cnt=0;
  for(auto& x:y){
    auto [i,j]=x;
    if(sum+i>K){
      idx=cnt;
      break;
    }
    sum+=i;
    cnt++;
  }
  cout<<(idx==-1 ? N : idx)<<" ";
  cout<<max(ll(0), K-sum);
  cerr<<"sum "<<sum<<endl;
}