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

def nibu(x, arr):
  if x <= arr[0]:
    return len(arr)
  if arr[-1] < x:
    return 0
  l = 0
  h = len(arr) - 1
  while h - l >1:
    m = (l + h) // 2
    if x <= arr[m]:
      h = m
    else:
      l = m
  return len(arr) - h

print(nibu(K, h))
 N, K = map(int, input().split()) N 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() h.sort h sort def nibu(x, arr):
  if x <= arr[0]:
    return len(arr)
  if arr[-1] < x:
    return 0
  l = 0
  h = len(arr) - 1
  while h - l >1:
    m = (l + h) // 2
    if x <= arr[m]:
      h = m
    else:
      l = m
  return len(arr) - h nibu if x <= arr[0]:
    return len(arr)
   x <= arr[0] x arr[0] arr 0 return len(arr) len(arr) len arr if arr[-1] < x:
    return 0
   arr[-1] < x arr[-1] arr -1 x return 0 0 l = 0 l 0 h = len(arr) - 1 h len(arr) - 1 len(arr) len arr 1 while h - l >1:
    m = (l + h) // 2
    if x <= arr[m]:
      h = m
    else:
      l = m
   h - l >1 h - l h l 1 m = (l + h) // 2 m (l + h) // 2 l + h l h 2 if x <= arr[m]:
      h = m
    else:
      l = m
   x <= arr[m] x arr[m] arr m h = m h m l = m l m return len(arr) - h len(arr) - h len(arr) len arr h x x arr arr print(nibu(K, h)) print nibu(K, h) nibu K h K = map(int, input().split()) map(int, input().split()) K def nibu(x, arr):
  if x <= arr[0]:
    return len(arr)
  if arr[-1] < x:
    return 0
  l = 0
  h = len(arr) - 1
  while h - l >1:
    m = (l + h) // 2
    if x <= arr[m]:
      h = m
    else:
      l = m
  return len(arr) - h def nibu(x, arr):
  if x <= arr[0]:
    return len(arr)
  if arr[-1] < x:
    return 0
  l = 0
  h = len(arr) - 1
  while h - l >1:
    m = (l + h) // 2
    if x <= arr[m]:
      h = m
    else:
      l = m
  return len(arr) - h nibu h = list(map(int, input().split())) list(map(int, input().split())) h N, K = map(int, input().split()) map(int, input().split()) N
N, K = map(int, input().split())
h = list(map(int, input().split()))
h.sort()

def nibu(x, arr):
  if x <= arr[0]:
    return len(arr)
  if arr[-1] < x:
    return 0
  l = 0
  h = len(arr) - 1
  while h - l >1:
    m = (l + h) // 2
    if x <= arr[m]:
      h = m
    else:
      l = m
  return len(arr) - h

print(nibu(K, h))

