#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int N, M;
  cin >> N >> M;
  priority_queue<int, vector<int>, greater<int>> que;
  for (int i = 0; i < N; i++) {
    int c;
    cin >> c;
    que.push(c);
  }
  for (int i = 0; i < M; i++) {
    int c = que.top() - 1;
    que.pop();
    if (c != 0) que.push(c);
  }
  cout << N - (int)que.size() << '\n';
  return 0;
}