N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster?

-----Constraints-----
 -  1 \le N \le 10^5 
 -  1 \le K \le 500 
 -  1 \le h_i \le 500
 - All values in input are integers.

-----Input-----
Input is given from Standard Input in the following format:
N K
h_1 h_2 \ldots h_N

-----Output-----
Print the number of people among the Takahashi's friends who can ride the roller coaster.

-----Sample Input-----
4 150
150 140 100 200

-----Sample Output-----
2

Two of them can ride the roller coaster: the first and fourth friends.

Difficulty: introductory

Starter code:

Solutions:
n, limit = map(int, input().split())
lst = list(map(int, input().split()))
count = 0
for i in range(n):
    if lst[i] >= limit:
        count += 1

print(count)

N, K = map(int, input().split())
h = map(int, input().split())
ride = 0

for cm in h:
    if cm >= K:
        ride = ride + 1
    else:
        continue

print(ride)

N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
s=0
for i in H:
    if i>=K:
        s=s+1
print(s)


n,k=map(int,input().split())
h=list(map(int,input().split()))

count=0

for i in h:
    if i>=k:
        count+=1

print(count)

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

# N人で遊園地に遊びにいきました。
# ジェットコースターに乗るためには、身長が Kcm以上 必要です。
# 高橋君の仲間たちのうち、一番人気のジェットコースターに乗ることのできる人の数を出力してください。

availability = 0

for i in range(0, N):
    if height[i] >= K:
        availability += 1

print(availability)

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

ans = 0
for hi in i:
    if hi >= K:
        ans += 1
print(ans)

S_list = [input() for i in range(2)]
N,K = map(int,S_list[0].split())    
h_list = list(map(int,S_list[1].split()))
number = 0
for i in h_list:
    if i>=K:
        number += 1
print(number) 

N, K = map(int, input().split())
H = list(map(int, input().split()))
count = 0
for h in H:
    if h >= K:
        count = count+1
print(count)

n,k=map(int,input().split())
h=list(map(int,input().split()))
c=0
for e in h:
    if e >= k:
        c+=1
print(c)

N, K = map(int, input().split())
print(sum([h >= K for h in map(int, input().split())]))

n,k = map(int,input().split())
h = list(map(int,input().split()))
ans = 0
for i in h:
  if i >= k:
    ans += 1
print(ans)

num_persons, need_height = list(map(int, input().split()))
a = list(map(int, input().split()))
height_list = list(a)

count_height_ok = 0

for i in height_list:
    if i >= need_height:
        count_height_ok += 1

print(count_height_ok)


mem_num, over_height = map(int, input().split())
members_hgt = list(map(int, input().split()))
cnt = 0

for i in members_hgt:
    if i >= over_height:
        cnt += 1

print(cnt)

3
import sys
input = lambda: sys.stdin.readline().strip()
n, k = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
print((sum(1 for x in h if x >= k)))


n, k = map(int, input().split())
h = list(map(int, input().split()))
c = 0
for i in h:
  if i >= k:
    c += 1
print(c)

N, K = map(int,input().split())
S = map(int,input().split())

height_list = list(S)
ride_person = 0

for i in height_list:
    if i >= K:
        ride_person += 1

print(ride_person)

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

ans = 0
for i in range(N):
  if h[i] >= K: ans += 1
    
print(ans)

n, k = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
cnt = 0
for hi in h:
  if hi >= k:
    cnt += 1
print(cnt)

n,k = map(int,input().split())
h = list(map(int,input().split()))
# ジェットコースターの乗れる人の数
able_num = 0
# リスト内の数字を取り出して、ｋより大きければ乗れる人をカウントアップ
for i in h:
    if i >= k:
        able_num += 1
print(able_num)

n, k = map(int, input().split())
H = list(map(int, input().split()))
print(sum(h >= k for h in H))

N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
count = 0
for h in H:
    if h >= K:
        count = count+1
print(count)


n,k = map(int,input().split())
li = list(map(int,input().split()))
cnt = 0
for i in li:
    if i >= k:
        cnt += 1

print(cnt)

n,k = map(int,input().split())
h = list(map(int,input().split()))
ans = 0
for i in range(n):
  if h[i] >= k:
    ans += 1
print(ans)

import numpy as np

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

print(np.sum(h >= K))

n,k=map(int,input().split())
h=list(map(int,input().split()))
ans=0
for i in range(n):
    if h[i]>=k:
        ans+=1
print(ans)

n, k = list(map(int, input().split()))
h = list(map(int, input().split()))

cnt = 0

for i in range(n):
    if h[i] >= k:
        cnt += 1
print(cnt)


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


print(len([i for i in h if K <= i]))

n,k=map(int,input().split())
h=list(map(int,input().split()))
ans=0
for i in h:
    if k<=i:
        ans+=1
print(ans)

n, k = list(map(int, input().split()))
h = list(map(int, input().split()))

def answer(n: int, k: int, h: list) -> int:
    ans = 0
    for i in range(0, n):
        if h[i] >= k:
            ans += 1
    return ans

print((answer(n, k, h)))


N,K = map(int,input().split())
h = [int(i) for i in input().split()]
ans = 0
for i in range(N):
    if(h[i] >= K):
        ans += 1
print(ans)

n, k = map(int, input().split())
h = list(map(int, input().split()))

print(len([i for i in h if i >= k]))

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

ans=0

for h in H:
	if h>=K:
		ans+=1

print(ans)

n,k=map(int,input().split())
h=list(map(int,input().split()))
ans=0
for i in range(n):
  if h[i]>=k:
    ans+=1
print(ans)

N, K = list(map(int,input().split()))
H = list(map(int,input().split()))
s = 0
for i in H:
    if K <= i:
        s += 1

print(s)


N, K = map(int,input().split())
friend = list(map(int,input().split()))
clear = []

for i in friend:
    if i >= K:
        clear.append(i)

print(len(clear))

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

ans = 0
for i in range(N):
  if h[i] >= K:
    ans += 1
print(ans)

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

h_l = [int(i) for i in h if i >= K]

print(len(h_l))

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

def ans142(N:int, K:int, h:list):
    N=int(N)
    K=int(K)
    count=0
    if N==1:
        h=int(h)
        if h>=K:
           return(1)
        elif h<K:
           return(0)
    else:
     h=h.split()
     for i in range(0,N):
        if int(h[i])>=K:
            count+=1
     return(count)
print((ans142(N,K,h)))


N, K = map(int, input().split())
h_list = list(map(int, input().split()))
ans = 0
for h in h_list:
    if h >= K:
        ans += 1
print(ans)

total_people, min_height = map(int, input().split())
height = map(int, input().split())
rideable_people = 0
for i in height:
    if i >= min_height:
        rideable_people += 1
print(rideable_people)

N, K = map(int, input().split())
H = list(map(int, input().split()))
print(len(list(filter(lambda x: x >= K, H))))

N,K=map(int,input().split())
hi=list(map(int,input().split()))
HI=[i for i in hi if i>=K]
print(len(HI))

n,k=map(int,input().split());print(sum(i>=k for i in map(int,input().split())))

n, k = map(int, input().split())
H = list(map(int, input().split()))

ans = 0

for h in H:
  if h >= k:
    ans += 1

print(ans)

N, K = map(int, input().split())
h = list(map(int, input().split()))
print(sum(1 if t >= K else 0 for t in h))

N, K = map(int, input().split())
lst = list(map(int, input().split()))
ans = 0

for i in lst:
    if i >= K:
        ans += 1

print(ans)

n,k=map(int,input().split())
s=0
for m in map(int,input().split()):
  if m>=k:s+=1
print(s)

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

ans = 0
for i in range(N):
    if h[i] >= K:
        ans += 1

print(ans)

n,k=map(int, input().split())
h=list(map(int, input().split()))
count=0
for i in range(n):
  if h[i]>=k:
    count+=1
print(count)

n,k = list(map(int,input().split()))
friend = list(map(int,input().split()))

count = 0
for x in friend:
  if x >= k:
    count += 1

print(count)


n, k = list(map(int, input().split()))
h = list(map(int, input().split()))

ans = len([i for i in h if i >= k])
print(ans)


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


for i in range(N):
    if h[i] >= K:
        count += 1

print(count)

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

x = 0
for i in h:
    if i >= K:
        x += 1
print(x)

n,k=map(int,input().split())
h=list(map(int,input().split()))
ans=0
for i in h:
    if(i>=k):
        ans+=1
print(ans)

# Kより大きいやつを抽出してlenで要素を返す
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))

possible = []

for i in h:
    if i >= K:
        possible.append(i)

print((len(possible)))


from bisect import bisect_left
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
h.sort()
i = bisect_left(h, k)
print((n-i))


x, y = map(int, input().split())
num_list = [num for num in map(int, input().split()) if num >= y]
print(len(num_list))

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

result = 0

for h in heights:
    if h >= K:
        result += 1
print(result)

n, k = list(map(int, input().split(' ')))
h = list(map(int, input().split(' ')))
print((sum(i >= k for i in h)))


n, h = map(int, input().split())
shin = list(map(int, input().split()))
count = 0
for i in shin:
    if i >= h:
        count += 1
print(count)

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

count = 0
for i in h:
    if i >= K:
        count += 1
print(count)

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

answer = 0

for i in h:
    if i >= K:
        answer += 1

print(answer)

n,k=map(int,input().split())
l=list(map(int,input().split()))
ans=sum(x>=k for x in l)
print(ans)

n,k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
res = 0
for i in range(n):
  if k <= a[i]:
    res += 1
print(res)

n,k = map(int, input().split())
H = list(map(int, input().split()))

cnt = 0

for i in range(n):
    cnt += H[i] >= k

print(cnt)

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

person = 0

for i in range(0, N):
    if h[i] >= K:
        person += 1

print(person)

N, K = map(int, input().split())
H = map(int, input().split())
height_list = list(H)

ride = 0

for i in height_list:
    if i >= K:
        ride += 1

print(ride)

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

ans = 0
for h_ in h:
    if h_ >= K:
        ans += 1
print(ans)

n,k = map(int,input().split())
h = list(map(int,input().split()))
ans = 0
for i in range(n):
    if h[i] >= k:
        ans += 1
print(ans)

# 高橋君の仲間たちは N 人で遊園地に遊びにいきました。 遊園地の一番人気のジェットコースターに乗るためには、身長が K cm以上必要です。
# 高橋君の i 番目の仲間の身長は h i cm です。 高橋君の仲間たちのうち、一番人気のジェットコースターに乗ることができる人の数を求めてください。

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

x = 0
for i in h:
    if i >= K:
        x += 1

print(x)

N,K=list(map(int,input().split()))
h=list(map(int,input().split()))
print((sum(x>=K for x in h)))


n, k = map(int,input().split())
h = list(map(int,input().split()))
count = 0

for i in range(n):
  if h[i] >= k:
    count += 1

print(count)

def atc_142b(NK_input: str, hi_input: str) -> int:
    N, K = list(map(int, NK_input.split(" ")))
    hi = [int(i) for i in hi_input.split(" ")]
    hi = sorted(hi)
    for i in range(0, len(hi)):
        if hi[i] >= K:
            return len(hi) - i
    return 0


NK_input_value = input()
hi_input_value = input()
print((atc_142b(NK_input_value, hi_input_value)))


n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
ans=0
for x in h:
    if x>=k:
        ans+=1
print(ans)



def answer(n: int, k: int, h: []) -> int:
    return len(list(i for i in h if k <= i))


def main():
    n, k = list(map(int, input().split()))
    h = list(map(int, input().split()))
    print((answer(n, k, h)))


def __starting_point():
    main()

__starting_point()

n,k =list(map(int, input().split()))

h = list(map(int, input().split()))

# n = int(input())
# s = [map(int, input()) for i in range(3)]

count = 0
for i in range (0,n):
    if h[i] < k:
        count+=1

print((n-count))


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

a = 0
for i in h:
    if i >= K:
     a += 1

print(a)

n,k = map(int,input().split())
h = list(map(int,input().split()))
print(len([h[i] for i in range(n) if h[i]>=k]))

n, k = map(int, input().split())
list01 = input().split()
list02 = [int(a) for a in list01]
x = 0
for i in list02:
    if i >= k:
        x += 1
    else:
        pass
print(x)

def atc_142b(NK_input: str, hi_input: str) -> int:
    N, K = map(int, NK_input.split(" "))
    hi = [int(i) for i in hi_input.split(" ")]
    hi = sorted(hi)
    for i in range(0, len(hi)):
        if hi[i] >= K:
            return len(hi) - i
    return 0


NK_input_value = input()
hi_input_value = input()
print(atc_142b(NK_input_value, hi_input_value))

n,k = list(map(int, input().split()))
h = list(map(int, input().split()))
print(sum(height >= k for height in h))

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

answer = sum(i >= K for i in h)

print(answer)

n,k = map(int, input().split())
a= list(map(int, input().split()))
o=0
i=0

for i in range(n):
    if a[i]>=k:
        o+=1

print(o)

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

cnt = 0
for i in l:
    if i >= K:
        cnt = cnt + 1

print(cnt)

N, K = map(int, input().split())
h = list(map(int, input().split()))
print(sum(h[i] >= K for i in range(N)))

import numpy as np

n,k=list(map(int,input().split()))
h=np.array(list(map(int,input().split())))

print((np.count_nonzero(h-k>=0)))


# B - Roller Coaster

#  N K
N, K = list(map(int, input().split()))
my_list = list(map(int, input().split(maxsplit=N)))
answer = 0

for i in range(0, N):
    if my_list[i] >= K:
        answer += 1

print(answer)


n, k = list(map(int, input().split(' ')))
h = list(map(int, input().split(' ')))
ans = 0
for i in range(len(h)):
    if h[i] >= k:
        ans += 1
print(ans)


N,K = map(int, input().split())

data = list(map(int,input().split()))
cnt =0

for i in range(len(data)):
    if data[i]>= K:
        cnt += 1
print(cnt)

n,k=map(int,input().split())
xlist =list(map(int,input().split()))
count = 0
for i in range(n):
  if xlist[i]>=k:
    count+=1
print(count)

import bisect
def resolve():
    n,k = map(int,input().split())
    h = sorted(list(map(int,input().split())))
    print(n-bisect.bisect_left(h,k))
resolve()

N, K = [int(n) for n in input().split()]
h = [int(n) for n in input().split()  if int(n) >= K ]
print(len(h))

n,k=list(map(int ,input().split()))
h=list(map(int ,input().split()))
count=0
for i in range(0,len(h)):
	if(h[i] == k or h[i] >=k ):
		count+=1
	else:
		count+=0

print((int(count)))


n, k = list(map(int, input().split(' ')))
h = list(map(int, input().split(' ')))
ans = 0
for i in h:
    if i >= k:
        ans += 1
print(ans)


n,k = map(int, input().split())
h = map(int, input().split())
print(len([i for i in h if i >= k]))

N, K = map(int, input().split())
h = list(map(int, input().split()))
def count ():
    count = 0
    for i in range(N):
        if h[i] >= K:
            count +=1
    
    return count
print(count())

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

ANS = sum(x >= K for x in H)
print(ANS)

n, k = map(int, input().split())
heights = list(map(int, input().split()))

count = 0
for height in heights:
    if k <= height:
        count = count + 1

print(count)

N,K=map(int,input().split())
H=list(map(int,input().split()))
answer=0

for i in range(N):
  if H[i]>=K:
    answer+=1
print(answer)