import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a,b=mi()
l=list(mi())
l=sorted(l)
ind=bisect.bisect_left(l,b)
print(a-ind) import math math import sys sys from collections import deque import heapq heapq import copy copy import itertools itertools from itertools import permutations from itertools import combinations import bisect bisect def mi() : return map(int,sys.stdin.readline().split()) mi def ii() : return int(sys.stdin.readline().rstrip()) ii def i() : return sys.stdin.readline().rstrip() i a,b=mi() a mi() mi b l=list(mi()) l list(mi()) list mi() mi l=sorted(l) l sorted(l) sorted l ind=bisect.bisect_left(l,b) ind bisect.bisect_left(l,b) bisect.bisect_left bisect bisect_left l b print(a-ind) print a-ind a ind ind=bisect.bisect_left(l,b) bisect.bisect_left(l,b) ind a,b=mi() mi() a def i() : return sys.stdin.readline().rstrip() def i() : return sys.stdin.readline().rstrip() i l=sorted(l) sorted(l) l l=list(mi()) list(mi()) l def ii() : return int(sys.stdin.readline().rstrip()) def ii() : return int(sys.stdin.readline().rstrip()) ii b=mi() mi() b def mi() : return map(int,sys.stdin.readline().split()) def mi() : return map(int,sys.stdin.readline().split()) mi
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a,b=mi()
l=list(mi())
l=sorted(l)
ind=bisect.bisect_left(l,b)
print(a-ind)