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

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



list_h.sort()

list_h.insert(0, 0)

list_h.append(500)



L, R = 0, N + 1

while R - L > 1:

    C = (L + R) // 2

    if list_h[C] >= K:

        R = C

    else:

        L = C



print((len(list_h[R:-1])))

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

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



count = 0

for i in list_h:

    if i >= K:

        count += 1



print(count)

N, K = list(map(int, input().split()))
list_h = list(map(int, input().split()))
list_h.sort()
list_h.insert(0, 0)
list_h.append(500)
L, R = 0, N + 1
while R - L > 1:
    C = (L + R) // 2
    if list_h[C] >= K:
        R = C
    else:
        L = C
print((len(list_h[R:-1])))

N, K = list(map(int, input().split()))
list_h = list(map(int, input().split()))
count = 0
for i in list_h:
    if i >= K:
        count += 1
print(count)

-list_h.sort() -list_h.insert(0, 0) -list_h.append(500) -L, R = 0, N + 1 -while R - L > 1: -    C = (L + R) // 2 -    if list_h[C] >= K: -        R = C -    else: -        L = C -print((len(list_h[R:-1]))) +count = 0 +for i in list_h: +    if i >= K: +        count += 1 +print(count)