#include <bits/stdc++.h>
using namespace std;
bool ps(long long n) {
  if (n < 0) return false;
  long long root(round(sqrt(n)));
  return n == root * root;
}
bool isPrime(long long number) {
  if (number < 2) return false;
  if (number == 2) return true;
  if (number % 2 == 0) return false;
  for (int i = 3; (i * i) <= number; i += 2) {
    if (number % i == 0) return false;
  }
  return true;
}
int main() {
  long long n, x;
  cin >> n >> x;
  long long op = 0;
  long long a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] == x) {
      op++;
    }
  }
  for (int i = 0; i < x; i++) {
    int flag = 0;
    for (int j = 0; j < n; j++) {
      if (a[j] == i) {
        flag = 1;
        break;
      }
    }
    if (flag == 0) {
      op++;
    }
  }
  cout << op << endl;
}
