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

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

h = sorted(h, reverse=True)

for i, h_i in enumerate(h):

  if h_i >= K:

    continue

  else:

    print(i)

    exit()



print(N)
import bisect



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

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

h = sorted(h)

print((N - bisect.bisect_left(h,K)))

N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
h = sorted(h, reverse=True)
for i, h_i in enumerate(h):
    if h_i >= K:
        continue
    else:
        print(i)
        exit()
print(N)

import bisect

N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
h = sorted(h)
print((N - bisect.bisect_left(h, K)))

+import bisect + -h = sorted(h, reverse=True) -for i, h_i in enumerate(h): -    if h_i >= K: -        continue -    else: -        print(i) -        exit() -print(N) +h = sorted(h) +print((N - bisect.bisect_left(h, K)))