#include <bits/stdc++.h>
using namespace std;
typedef priority_queue<pair<int, int>, vector<pair<int, int> >,
                       greater<pair<int, int> > >
    pq;
long long mod = 1000 * 1000 * 1000 + 7;
long long ans;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int n, x;
  cin >> n >> x;
  vector<bool> c(105, 0);
  for (int i = (0); i < (n); i++) {
    int a;
    cin >> a;
    c[a] = 1;
  }
  int ans = 0;
  for (int i = (0); i < (x); i++) ans += (!c[i]);
  ans += c[x];
  cout << ans;
  return 0;
}
