import bisect
def resolve():
    n,k = map(int,input().split())
    h = sorted(list(map(int,input().split())))
    print(n-bisect.bisect_left(h,k))
resolve() import bisect bisect def resolve():
    n,k = map(int,input().split())
    h = sorted(list(map(int,input().split())))
    print(n-bisect.bisect_left(h,k)) resolve n,k = map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split k h = sorted(list(map(int,input().split()))) h sorted(list(map(int,input().split()))) sorted list(map(int,input().split())) list map(int,input().split()) map int input().split() ().split () input split print(n-bisect.bisect_left(h,k)) print n-bisect.bisect_left(h,k) n bisect.bisect_left(h,k) bisect.bisect_left bisect bisect_left h k resolve() resolve def resolve():
    n,k = map(int,input().split())
    h = sorted(list(map(int,input().split())))
    print(n-bisect.bisect_left(h,k)) def resolve():
    n,k = map(int,input().split())
    h = sorted(list(map(int,input().split())))
    print(n-bisect.bisect_left(h,k)) resolve
import bisect
def resolve():
    n,k = map(int,input().split())
    h = sorted(list(map(int,input().split())))
    print(n-bisect.bisect_left(h,k))
resolve()