#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>
#include <sstream>

using namespace std;


int main() {
	int i, j;
	long n, m;
	vector<long>c;

	cin >> n >> m;


	for (i = 0; i < n; i++) {
		long num;
		cin >> num;
		c.push_back(num);
	}

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

	int index = 0;

	for (i = 0; i < m; i++) {
		if (c[index] > 0) {
			c[index]--;
		}
		else {
			index++;
			if (index <= n - 1) {
				c[index]--;
			}
			else {
				break;
			}
		}
	}

	int cnt = 0;

	for (i = 0; i < c.size(); i++) {
		if (c[i] == 0) {
			cnt++;
		}
	}

	cout << cnt << endl;



	getchar();
	getchar();
	return 0;
}