#include<bits/stdc++.h>
using namespace std;
int main()
{
    int N,M;
    cin>>N>>M;
    priority_queue<int,vector<int>,greater<int>>q;
    for(int i=0;i<N;i++)
    {
        int c; cin>>c;
        q.push(c);
    }
    while(!q.empty()&&M--)
    {
        int c=q.top();
        q.pop();
        c--;
        if(c)q.push(c);
    }
    cout << N-q.size() << endl;
}