import bisect

N,K =list(map(int,input().split()))

H =sorted(list(map(int,input().split())))

i = bisect.bisect(H,K-1)

print((N-i))
N,K = list(map(int,input().split()))

H  = list(map(int,input().split()))

counter = 0

for h in H:

  if h >= K:

    counter += 1

    

print(counter)

import bisect

N, K = list(map(int, input().split()))
H = sorted(list(map(int, input().split())))
i = bisect.bisect(H, K - 1)
print((N - i))

N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
counter = 0
for h in H:
    if h >= K:
        counter += 1
print(counter)

-import bisect - -H = sorted(list(map(int, input().split()))) -i = bisect.bisect(H, K - 1) -print((N - i)) +H = list(map(int, input().split())) +counter = 0 +for h in H: +    if h >= K: +        counter += 1 +print(counter)