#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
const int MAXN = 108;
int num[MAXN];
int main() {
  int n, m;
  while (scanf("%d%d", &n, &m) == 2) {
    int x;
    memset(num, 0, sizeof(num));
    for (int i = (0); i < (n); ++i) {
      scanf("%d", &x);
      num[x] = 1;
    }
    int ans = 0;
    for (int i = (0); i < (m); ++i)
      if (num[i] == 0) ans++;
    if (num[m] == 1) ans++;
    printf("%d\n", ans);
  }
  return 0;
}
