#ABC 142 B
N,K = map(int,input().split())
H = [int(h) for h in input().split()]
H = sorted(H)
import bisect
ans =len(H)-bisect.bisect_left(H,K)
print(ans) N,K = map(int,input().split()) N map(int,input().split()) map int input().split() ().split () input split K int(h) for h in input().split() for h in input().split() h input().split() ().split () input split for h in input().split() int(h) int h H = [int(h) for h in input().split()] H [int(h) for h in input().split()] H = sorted(H) H sorted(H) sorted H import bisect bisect ans =len(H)-bisect.bisect_left(H,K) ans len(H)-bisect.bisect_left(H,K) len(H) len H bisect.bisect_left(H,K) bisect.bisect_left bisect bisect_left H K print(ans) print ans H = [int(h) for h in input().split()] [int(h) for h in input().split()] H H = sorted(H) sorted(H) H N,K = map(int,input().split()) map(int,input().split()) N ans =len(H)-bisect.bisect_left(H,K) len(H)-bisect.bisect_left(H,K) ans K = map(int,input().split()) map(int,input().split()) K
#ABC 142 B
N,K = map(int,input().split())
H = [int(h) for h in input().split()]
H = sorted(H)
import bisect
ans =len(H)-bisect.bisect_left(H,K)
print(ans)