n,k = map(int,input().split())
ans = 0
h = list(map(int,input().split()))
h.sort()
if h[n-1] < k:
    print(0)
    exit()
while True:
  if h[ans] >= k:
    break
  else:
    ans += 1
print(len(h[ans:])) n,k = map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split k ans = 0 ans 0 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() h.sort h sort if h[n-1] < k:
    print(0)
    exit() h[n-1] < k h[n-1] h n-1 n 1 k print(0) print 0 exit() exit while True:
  if h[ans] >= k:
    break
  else:
    ans += 1 True if h[ans] >= k:
    break
  else:
    ans += 1 h[ans] >= k h[ans] h ans k break ans += 1 ans 1 print(len(h[ans:])) print len(h[ans:]) len h[ans:] h ans: ans ans += 1 1 ans n,k = map(int,input().split()) map(int,input().split()) n k = map(int,input().split()) map(int,input().split()) k ans = 0 0 ans h = list(map(int,input().split())) list(map(int,input().split())) h
n,k = map(int,input().split())
ans = 0
h = list(map(int,input().split()))
h.sort()
if h[n-1] < k:
    print(0)
    exit()
while True:
  if h[ans] >= k:
    break
  else:
    ans += 1
print(len(h[ans:]))