#include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
  
const ll MOD=1e9+7;
const ll INF=1e18;
const double pi=acos(-1);
int dx[8] = {1,0,-1,0,1,1,-1,-1};
int dy[8] = {0,1,0,-1,-1,1,1,-1};
 
const int MAX=510000;
int main(){
  cin.tie(0);
  ios::sync_with_stdio(false); 
   
  int n,m;
  cin >> n >> m;
  priority_queue<int,vector<int>,greater<int>>q;
  rep(i,n){
    int c;
    cin >> c;
    q.push(c);
  }
  while(m && !q.empty()){
    m--;
    int t=q.top();
    q.pop();
    t--;
    if(t==0)continue;
    q.push(t);
  }
  cout << n-q.size() << endl; 
  return 0;
}