#include <bits/stdc++.h>
using namespace std;

signed main(){
  int N, M; cin >> N >> M;
  vector< int > C( N );
  for( int i = 0; i < N; ++i )
    cin >> C[ i ];
  priority_queue< int, vector< int >, greater< int > > pq;
  for( int i = 0; i < N; ++i )
    pq.emplace( C[ i ] );
  for( int i = 0; i < M; ++i ){
    int c = pq.top(); pq.pop();
    if( c == 1 ) continue;
    pq.emplace( c - 1 );
  }
  cout << N - pq.size() << endl;
  return 0;
}