#include <bits/stdc++.h>
using namespace std;
template <class T>
T bigmod(T b, T p, T m) {
  if (p == 0) return 1 % m;
  T x = b;
  T ans = 1;
  while (p) {
    if (p & 1) ans = (ans * x) % m;
    p >>= 1;
    x = (x * x) % m;
  }
  return ans;
}
template <class T>
T gcd(T x, T y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
template <typename T>
T POW(T b, T p) {
  if (p == 1) return b;
  if (p % 2 == 0) {
    T s = POW(b, p / 2);
    return s * s;
  }
  return b * POW(b, p - 1);
}
template <typename T>
T modinv(T num, T m) {
  return bigmod(num, m - 2, m);
}
int main() {
  long long i, j, k, l, m, n;
  cin >> n >> m >> k;
  long long a[100005];
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long count = 0;
  for (i = 0; i < n; i++) {
    if (a[i] == 1) {
      if (m)
        m--;
      else
        count++;
    }
    if (a[i] == 2) {
      if (k)
        k--;
      else if (m)
        m--;
      else
        count++;
    }
  }
  cout << count;
  return 0;
}
