import math
import itertools
import sys
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))

h.sort(reverse=True)
ans = 0
for i in range(len(h)):
    if(h[i] < k):
        ans = i
        print(ans) 
        sys.exit()

print(len(h)) import math math import itertools itertools import sys sys n,k = list(map(int,input().split())) n list(map(int,input().split())) list 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 ans = 0 ans 0 for i in range(len(h)):
    if(h[i] < k):
        ans = i
        print(ans) 
        sys.exit() i range(len(h)) range len(h) len h if(h[i] < k):
        ans = i
        print(ans) 
        sys.exit() h[i] < k h[i] h i k ans = i ans i print(ans) print ans sys.exit() sys.exit sys exit print(len(h)) print len(h) len h n,k = list(map(int,input().split())) list(map(int,input().split())) n ans = 0 0 ans ans = i i ans k = list(map(int,input().split())) list(map(int,input().split())) k h = list(map(int,input().split())) list(map(int,input().split())) h
import math
import itertools
import sys
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))

h.sort(reverse=True)
ans = 0
for i in range(len(h)):
    if(h[i] < k):
        ans = i
        print(ans) 
        sys.exit()

print(len(h))