#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <string>
#include <map>
#include <iterator>
#include <set>
#include <queue>

using namespace std;


int main() {

    int N, M;
    cin >> N >> M;

    vector<int> vs;
    for (int i = 0; i < N; ++i) {
        int C;
        cin >> C;
        vs.push_back(C);
    }

    sort(vs.begin(), vs.end());

    int j = 0;
    for (int i = 0; i < M; ++i) {
        if (vs[j] > 0) {
            vs[j] -= 1;
        } else {
            j += 1;
            vs[j] -= 1;
        }
    }
    int cnt = 0;
    for (int i = 0; i < N; ++i) {
        if (vs[i] == 0) {
            cnt += 1;
        } else {
            break;
        }
    }
    cout << cnt << endl;

    return 0;
}