N,K = map(int,input().split())
H = sorted(map(int,input().split()))
count = N
for i in range(N):
    if H[i]>=K:
        count = i
        break
print(N-count) N,K = map(int,input().split()) N map(int,input().split()) map int input().split() ().split () input split K H = sorted(map(int,input().split())) H sorted(map(int,input().split())) sorted map(int,input().split()) map int input().split() ().split () input split count = N count N for i in range(N):
    if H[i]>=K:
        count = i
        break i range(N) range N if H[i]>=K:
        count = i
        break H[i]>=K H[i] H i K count = i count i break print(N-count) print N-count N count N,K = map(int,input().split()) map(int,input().split()) N H = sorted(map(int,input().split())) sorted(map(int,input().split())) H K = map(int,input().split()) map(int,input().split()) K count = N N count count = i i count
N,K = map(int,input().split())
H = sorted(map(int,input().split()))
count = N
for i in range(N):
    if H[i]>=K:
        count = i
        break
print(N-count)