#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100;
int n, x, a;
int f[MAXN + 1];
int main() {
  cin >> n >> x;
  memset(f, 0, sizeof f);
  for (int i = 0; i < n; i++) {
    cin >> a;
    f[a] = 1;
  }
  int ans = 0;
  for (int i = 0; i < x; i++) {
    if (f[i] == 0) ans++;
  }
  if (f[x] == 1) ans++;
  cout << ans << endl;
  return 0;
}
