import heapq



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

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

ans = 0

heap = []



for i in range(N):

    heapq.heappush(heap, h_list[i]*(-1))



for i in range(N):

    if (heapq.heappop(heap)*(-1) < K):

        break



    else:

        ans += 1





print(ans)
import heapq



def minus(x):

    y = int(x)

    return y*(-1)



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

h_list = list(map(minus,input().split()))

ans = 0

heapq.heapify(h_list)



for i in range(N):

    if (heapq.heappop(h_list)*(-1) < K):

        break



    else:

        ans += 1





print(ans)
import heapq

N, K = list(map(int, input().split()))
h_list = list(map(int, input().split()))
ans = 0
heap = []
for i in range(N):
    heapq.heappush(heap, h_list[i] * (-1))
for i in range(N):
    if heapq.heappop(heap) * (-1) < K:
        break
    else:
        ans += 1
print(ans)

import heapq


def minus(x):
    y = int(x)
    return y * (-1)


N, K = list(map(int, input().split()))
h_list = list(map(minus, input().split()))
ans = 0
heapq.heapify(h_list)
for i in range(N):
    if heapq.heappop(h_list) * (-1) < K:
        break
    else:
        ans += 1
print(ans)

+ +def minus(x): +    y = int(x) +    return y * (-1) + + -h_list = list(map(int, input().split())) +h_list = list(map(minus, input().split())) -heap = [] +heapq.heapify(h_list) -    heapq.heappush(heap, h_list[i] * (-1)) -for i in range(N): -    if heapq.heappop(heap) * (-1) < K: +    if heapq.heappop(h_list) * (-1) < K: