n , k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse = True)

for i in range(n):
    if h[i] < k:
        print(i)
        break
else:
    print(n)
 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(reverse = True) h.sort h sort reverse = True reverse True for i in range(n):
    if h[i] < k:
        print(i)
        break
else:
    print(n) i range(n) range n if h[i] < k:
        print(i)
        break h[i] < k h[i] h i k print(i) print i break print(n) print n n , k = map(int, input().split()) map(int, input().split()) n h = list(map(int, input().split())) list(map(int, input().split())) h k = map(int, input().split()) map(int, input().split()) k
n , k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse = True)

for i in range(n):
    if h[i] < k:
        print(i)
        break
else:
    print(n)

