problem

$ M $ students will be tested in a classroom with $ N $ seats in a straight line. Seats are numbered $ 1 \ dots N $ from the front, and $ 1 $ per seat can seat $ 1 $ students.

Now each student is sitting in the $ A_1, \ dots, A_M $ seats.

To start the test, the following conditions must be met:

* $ 1 \ dots M $ students are sitting in every seat.



Therefore, we decided to repeat the following operations until the conditions were met.

* Move the student sitting at the back and sit at the front of the vacant seats.



Find the number of operations required to meet the conditions.



output

Output the number of operations required to meet the conditions. Also, output a line break at the end.

Example

Input

6 4
1 4 5 6


Output

2

Source: aizu | Difficulty: UNKNOWN_DIFFICULTY


Solutions:
(n, m) = map(int, input().split())
a = list(map(int, input().split()))
num = m
for i in range(m):
	if a[i] <= m:
		num -= 1
print(num)


(n, m) = map(int, input().split())
a = list(map(int, input().split()))
ans = 0
for i in a:
	if m < i:
		ans += 1
print(ans)


(n, m) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
print(sum((x > m for x in a)))


(N, M) = map(int, input().split())
A = list(map(int, input().split()))
cnt = 0
for a in A:
	if a <= M:
		cnt += 1
print(M - cnt)


(n, m) = map(int, input().split())
print(m - len(list(filter(lambda x: x <= m, [int(x) for x in input().split()]))))


import bisect
(n, m) = map(int, input().split())
a = list(map(int, input().split()))
x = bisect.bisect_left(a, m + 1)
print(m - x)


(N, M) = (int(x) for x in input().split())
A = (int(x) for x in input().split())
print(M - len([x for x in A if x <= M]))