from bisect import bisect_left
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
res = 0
idx = bisect_left(H, K)
if idx < N:
    if H[idx] < K:
        res = N - idx - 1
    else:
        res = N - idx
print(res)
 from bisect import bisect_left N, K = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split K H = list(map(int, input().split())) H list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split H.sort() H.sort H sort res = 0 res 0 idx = bisect_left(H, K) idx bisect_left(H, K) bisect_left H K if idx < N:
    if H[idx] < K:
        res = N - idx - 1
    else:
        res = N - idx idx < N idx N if H[idx] < K:
        res = N - idx - 1
    else:
        res = N - idx H[idx] < K H[idx] H idx K res = N - idx - 1 res N - idx - 1 N - idx N idx 1 res = N - idx res N - idx N idx print(res) print res res = 0 0 res idx = bisect_left(H, K) bisect_left(H, K) idx res = N - idx - 1 N - idx - 1 res H = list(map(int, input().split())) list(map(int, input().split())) H N, K = map(int, input().split()) map(int, input().split()) N res = N - idx N - idx res K = map(int, input().split()) map(int, input().split()) K
from bisect import bisect_left
N, K = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
res = 0
idx = bisect_left(H, K)
if idx < N:
    if H[idx] < K:
        res = N - idx - 1
    else:
        res = N - idx
print(res)

