package chelper;

import java.util.HashSet;
import java.util.Set;

import io.InputReader;
import io.OutputWriter;
import misc.SimpleSavingChelperSolution;


public class A extends SimpleSavingChelperSolution {

  public void solve(int testNumber, InputReader in, OutputWriter out) {
    wrapSolve(testNumber, in, out);
  }

  @Override
  public void solve(int testNumber) {
    int n = in.nextInt();
    int x = in.nextInt();
    int[] a = in.nextIntArray(n);

    Set<Integer> set = new HashSet<>();
    for (int i = 0; i < n; i++) {
      set.add(a[i]);
    }

    int ans = 0;

    for (int i = 0; i < 1000; i++) {
      if (i < x && !set.contains(i)) {
        ans++;
      }
      if (i == x && set.contains(i)) {
        ans++;
      }
    }

    out.println(ans);
  }
}