import sys
import math
import numpy as np
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

N,K = I()
h = l()
h.sort()
print(N-bisect.bisect_left(h,K)) import sys sys import math math import numpy as np numpy import itertools itertools import bisect bisect from copy import copy from collections import deque,Counter from decimal import Decimal def s(): return input() s def i(): return int(input()) i def S(): return input().split() S def I(): return map(int,input().split()) I def L(): return list(input().split()) L def l(): return list(map(int,input().split())) l def lcm(a,b): return a*b//math.gcd(a,b) lcm a a b b sys.setrecursionlimit(10 ** 9) sys.setrecursionlimit sys setrecursionlimit 10 ** 9 10 9 INF = 10**9 INF 10**9 10 9 mod = 10**9+7 mod 10**9+7 10**9 10 9 7 N,K = I() N I() I K h = l() h l() l h.sort() h.sort h sort 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 def l(): return list(map(int,input().split())) def l(): return list(map(int,input().split())) l def i(): return int(input()) def i(): return int(input()) i mod = 10**9+7 10**9+7 mod def s(): return input() def s(): return input() s def lcm(a,b): return a*b//math.gcd(a,b) def lcm(a,b): return a*b//math.gcd(a,b) lcm K = I() I() K def I(): return map(int,input().split()) def I(): return map(int,input().split()) I def L(): return list(input().split()) def L(): return list(input().split()) L def S(): return input().split() def S(): return input().split() S INF = 10**9 10**9 INF N,K = I() I() N h = l() l() h
import sys
import math
import numpy as np
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

N,K = I()
h = l()
h.sort()
print(N-bisect.bisect_left(h,K))