#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
#include<iomanip>
using namespace std;
typedef long long int lont;
int main() {
	int N, M;
	cin >> N >> M;
	vector<int>veca(N);
	for (int ia = 0; ia < N; ia++) {
		cin >> veca.at(ia);
	}
	sort(veca.begin(), veca.end());
	for (int ib = 0; ib < M; ib++) {
		for (int id = 0; id <N; id++) {
			if (veca.at(id) != 0) {
				veca.at(id)--;
				break;
			}
		}
	}
	int cnta = 0;
	for (int ic = 0; ic < N; ic++) {
		if (veca.at(ic) == 0) {
			cnta++;
		}
	}
	cout << cnta << endl;
}