Problem:
 Score : 200 points    Problem Statement  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 1 4 150
150 140 100 200      Sample Output 1 2  Two of them can ride the roller coaster: the first and fourth friends.       Sample Input 2 1 500
499      Sample Output 2 0       Sample Input 3 5 1
100 200 300 400 500      Sample Output 3 5

Solution (Python):
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)

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

h = sorted(h)

for i in range(N):
    if h[i] >= K:
        print(len(h[i:]))
        exit()
print(0)

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

Solution (Python):
N,K=map(int,input().split())
h=list(map(int,input().split()))
print(sum(i>=K for i in h))

Solution (Python):
n, k = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]

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

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

Solution (Python):
n,k=map(int,input().split())
h=list(map(int,input().split()))
ans=n
for i in range(n):
  if h[i]<k:
    ans-=1
print(ans)

Solution (Python):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
n,k = iim()
h = iil()

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

Solution (Python):
import sys

input=sys.stdin.readline

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

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

print(ans)

Solution (Python):
N, K = map(int, input().split())
h_list = list(map(int, input().split()))

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

Solution (Python):
N, K = map(int, input().split())
members = list(map(int, input().split()))

print(len([m for m in members if m >= K]))

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

Solution (Python):
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)

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

Solution (Python):
import sys
input = sys.stdin.readline

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

print(sum([1 for x in h if x >= K]))

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

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

Solution (Python):
import sys
import numpy as np

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N, K = lr()
H = np.array(lr())
answer = np.count_nonzero(H >= K)
print(answer)

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

Solution (Python):
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)

Solution (Python):
import sys
input = sys.stdin.readline

n, k = 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)

Solution (Python):
_, k = map(int, input().split())
print([i >= k for i in list(map(int, input().split()))].count(1))

Solution (Python):
N, K = map(int, input().split())
h = list(map(int, input().split()))
h_new = [i for i in h if i >= K]
print(len(h_new))

Solution (Python):

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

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

Solution (Python):
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)

Solution (Python):

def solve():
    n, k = map(int, input().split())
    H = map(int, input().split())

    sm = 0
    for h in H:
        if h >= k:
            sm = sm + 1

    print(sm)



if __name__ == '__main__':
    solve()

Solution (Python):


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

ans = 0

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

print(ans)

Solution (Python):
N,K = map(int,input().split())
h = list(map(int,input().split()))
h.sort(reverse = True)
ans = 0
for i in range(N):
  if h[i] >= K:
    ans += 1
  else:
    break
print(ans)

Solution (Python):
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)

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

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

Solution (Python):
n, k = map(int, input().split())
h = list(map(int, input().split()))
c = 0

for i in range(n):
    if h[i] < k:
        c = c + 1
print(n - c)

Solution (Python):
n, k = map(int, input().split())
h = sorted(list(map(int, input().split())))
c = 0

for i in range(n):
    if h[i] < k:
        c = c + 1
    else:
        print(n - c)
        exit()
print(n - c)

Solution (Python):
N,K=map(int,input().split())
H=list(map(int,input().split()))
print(sum(1 for h in H if h>=K))

Solution (Python):
N,K = list(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)

Solution (Python):
n,h = map(int,input().split())
L = list(map(int,input().split()))
L = [x for x in L if x >=h]
print(len(L))

Solution (Python):
def get_ints():
    return map(int, input().split())

n, k = get_ints()
hs = get_ints()
ans = 0
for h in hs:
    if h >= k:
        ans += 1

print(ans)

Solution (Python):
n,k = map(int,input().split())
H = list(map(int,input().split()))
count = 0
for h in H:
  if h >= k:
   	count += 1
print(count)

Solution (Python):
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)

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

Solution (Python):
n, k = map(int, input().split())
h = list(map(int, input().split()))
cn=sum(hi>=k for hi in h)
print(cn)

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

count = 0
h.sort()

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

print(count)

Solution (Python):
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)

Solution (Python):
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)

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

print(count)

Solution (Python):
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)

Solution (Python):
nk=input().rstrip().split(" ")
n=int(nk[0])
k=int(nk[1])
leng=input().rstrip().split(" ")
count=0
for hei in leng:
    if int(hei)>=k:
        count+=1
print(count)

Solution (Python):
N, K = map(int, input().split())
H = list(map(int, input().split()))
print(sum(1 for i in H if i >=  K))

Solution (Python):
N,K = (int(i) for i in input().split())
h = list(map(int,input().split()))
ans = 0

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

print(ans)

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

Solution (Python):
n,k=map(int,input().split())
aa=list(map(int,input().split()))

x=0
for a in aa:
  if a >=k:
    x+=1
print(x)

Solution (Python):

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)

Solution (Python):

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)

Solution (Python):
N, K = map(int, input().split())
h = list(map(int, input().split()))
print (len([1 for x in h if x >= K]))

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):

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

print(sum([h[i] >= k for i in range(n)]))

Solution (Python):
N, K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]

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

print(res)

Solution (Python):
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)

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

Solution (Python):
N,K =map(int,input().split())
height = [int(i) for i in input().split()]
A = 0
for u in height:
  if u >= K:
    A += 1
print(A)

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

Solution (Python):
n,k= map(int,raw_input().split())
l = map(int,raw_input().split())
r= 0
for i in l:
    if i >= k:
        r += 1
print r

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

def main():
    N, K = input_nums()
    H = input_nums()
    res = len([h for h in H if h >= K])
    print(res)

if __name__ == '__main__':
    main()

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

Solution (Python):
N,K = list(map(int,input().split()))
H = list(map(int,input().split()))
l = [i for i in H if i>=K]
print(len(l))

Solution (Python):
import sys
input = sys.stdin.readline

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

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

    print(ans)


if __name__ == "__main__":
    main()

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

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

print(sum)

Solution (Python):
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)

Solution (Python):
N, K = map(int, input().split())
h = list(map(int, input().split()))
print(len([i for i in h if i >= K]))

Solution (Python):
def resolve():
    n,k = map(int,input().split())
    h = list(map(int,input().split()))
    ans = sum(x >= k for x in h)
    print(ans)
resolve()

Solution (Python):
n,k = map(int, input().split())
ls = list(map(int, input().split()))
a = 0
for i in range(0,n):
    if ls[i] >= k:
        a += 1
        continue
    else:
        continue
print(a)

Solution (Python):
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)

Solution (Python):
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
  	 if int(height[i])>=b:
  	 	count+=1
print(str(count))

Solution (Python):
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
  	 if int(height[i])>=b:
  	 	count+=1
print(count)

Solution (Python):
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
    if int(height[i])>=b:
       count+=1
print(count)

Solution (Python):
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
    if int(height[i])>=b:
       count+=1
print(count)

Solution (Python):
n, k = 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)

Solution (Python):
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)

Solution (Python):
x,y=list(map(int, input().split()))
z=list(map(int, input().split()))
count=0
for i in range(x):
	if z[i]>=y:
		count=count+1
print(count)

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

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

Solution (Python):
N,K=map(int,input().split())
h=list(map(int,input().split()))
ans=0
for i in range(N):
    if K<=h[i]:
        ans=ans+1
    else:
        pass
print(ans)

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

Solution (Python):







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)

Solution (Python):
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)

Solution (Python):

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


input_list = input().split( )

counter = 0
for i in range(N):
  if(int(input_list[i])>=K):
    counter = counter + 1
  else:
    counter = counter
print(counter)

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

Solution (Python):
n,k = map(int,input().split())
lis = list(map(int,input().split()))
ing_total = 0
for i in range(n):
    if lis[i] >= k:
        ing_total+=1

print(ing_total)

Solution (Python):
_, k, *h = map(int, open(0).read().split())
print(sum([i >= k for i in h]))

Solution (Python):
n, k = map(int, input().split())
hs = list(map(int, input().split()))
count = 0
for h in hs:
    if h >= k:
        count += 1
print(count)

Solution (Python):
n,k=map(int,input().split())
List=[int(i) for i in input().split()]
cnt=0
for i in range(0,n):
  if List[i]>=k:
    cnt=cnt+1
print(cnt)

Solution (Python):
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)

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

Solution (Python):
N,K = 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)

Solution (Python):
[N,K] = list(map(int,input().split()))
ls_h = list(map(int,input().split()))

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

Solution (Python):
N, K = 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)

Solution (Python):
def solve():
    N, M = map(int, input().split())
    A = list(map(int, input().split()))
    l = list(filter(lambda x: x >= M, A))
    return len(l)

print(solve())

Solution (Python):
def solve():
    N, M = map(int, input().split())
    A = list(map(int, input().split()))
    c = 0
    for a in A:
        if a >= M:
            c+=1
    return c

print(solve())

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

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

Solution (Python):
N,K=map(int,input().split())
h=input().split()
c=0

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

print(c)

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

Solution (Python):
N,K=map(int,input().split())
h=input().split()
S=0

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

print(S)

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

cnt = 0
for h in H:
    if h >= K:
        cnt += 1

print(cnt)

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

print(ans)

Solution (Python):
N,K=map(int,input().split())
h=input().split()
S=0

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

print(S)

Solution (Python):

"""
Created on Thu Mar 12 00:55:57 2020

@author: Kanaru Sato
"""

n,k = list(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)

Solution (Python):
N, K = map(int, input().split())
h = map(int, input().split())

l = [hi for hi in h if hi >= K]
print(len(l))

Solution (Python):






import numpy as np



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

arrh = np.array(input().split(),dtype=np.int64)

filter = arrh >= k
ans = len(arrh[filter])

print(ans)

Solution (Python):
N,K = map(int,input().split())
List = list(map(int,input().split()))

def func(n, k, lst):
  res = 0
  for i in range(n):
    if lst[i] >= k:
      res += 1
  return res

print(func(N, K ,List))

Solution (Python):
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)

Solution (Python):
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

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

Solution (Python):
n, k = map(int, input().split())
l = list(map(int, input().split()))
a = 0
for i in l:
    if i>=k:
        a += 1
print(a)

Solution (Python):
n, k = map(int,input().split())
h = list(map(int, input().split()))
cnt = 0
for i in h:
    if i >= k:
        cnt += 1
    else:
        pass
print(cnt)

Solution (Python):
n, k = map(int, input().split())
l = list(map(int, input().split()))
l.sort()
   
for i in range(n):
    if l[i] >= k:
        print(n-i)
        exit()
print(0)

Solution (Python):
N,K  = map(int, input().split())
H = list(map(int, input().split()))
c=0
for i in range(N):
  if H[i]>=K:
    c+=1
print(c)

Solution (Python):
n,k = map(int,input().split())
h = [int(x) for x in input().split()]

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

Solution (Python):
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)

Solution (Python):
N , M = (map(int , input().split()))
A = list(map(int , input().split()))
count = 0
for i in A:
    if i >= M:
        count += 1
print(count)

Solution (Python):
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)

Solution (Python):
def main():
    N,K = list(map(int,input().split()))
    h = list(map(int,input().split()))

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


if __name__ == "__main__":
    main()

Solution (Python):
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)

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

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

Solution (Python):
n,k = map(int,input().split())
a = list(map(int,input().split()))
print(sum(i >= k for i in a))

Solution (Python):
num, least = map(int,input().split())
high = [int(x) for x in input().split()]

high.sort(reverse = True)

count = 0
i = 0

while i < num:
    if high[i] >= least:
        count += 1
        i += 1
    else:
        break

print(count)

Solution (Python):
N,K = 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)

Solution (Python):
N,height = map(int,input().split())
A = list(map(int,input().split()))
ans = 0
for i in A:
  if i>=height:
    ans +=1
print(ans)

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
f=lambda:map(int,input().split())
_,k=f()
print(sum(i>=k for i in f()))

Solution (Python):
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)

Solution (Python):
number = input().split(" ")
N = int(number[0])
K = int(number[1])
human  = input().split(" ")
ans = 0
for i in human:
    if int(i) >= K:
        ans += 1
    else:
        pass
print(ans)

Solution (Python):
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)

Solution (Python):
import numpy as np
n,k=map(int,input().split())
H=np.array(list(map(int,input().split())))
print(np.count_nonzero(H>=k))

Solution (Python):
n,b=map(int,input().split())
l=list(map(int,input().split()))
cnt=0
for i in l:
  if i>=b:cnt+=1
print(cnt)

Solution (Python):

import sys
import numpy as np

def solve(N: int, K: int, h: "List[int]"):

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



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    h = [int(next(tokens)) for _ in range(N)]  
    solve(N, K, h)

if __name__ == '__main__':
    main()

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

cnt = 0

for i in h:
    if i >= k:
        cnt += 1
        
print(cnt)

Solution (Python):
N,K=map(int,input().split())
mylist=list(map(int,input().split()))
answer=0
for i in range(N):
    if mylist[i]>=K:
        answer+=1
print(answer)

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

Solution (Python):
N,K = map(int,input().split(" "))
List = [int(i) for i in input().split(" ") if int(i)>=K]
print(len(List))

Solution (Python):
import sys
import math
a,b= map(int,input().split())
li= [int(x) for x in input().split()]
i=count=0
for i in range(len(li)):
  if li[i]>=b:
    count+=1
print(count)

Solution (Python):
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)

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

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

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

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

Solution (Python):
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)

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

human = []
for i in h:
    if i >= k:
        human.append(i)

print(len(human))

Solution (Python):
from sys import stdin

n, k = [int(x) for x in stdin.readline().rstrip().split()]
h = [int(x) for x in stdin.readline().rstrip().split()]

hh = [i for i in h if i >= k]

print(len(hh))

Solution (Python):
import math
import sys
import numpy as np

def input():
    return sys.stdin.readline()[:-1]

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

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

Solution (Python):
N,K = map(int,input().split())
H = list(map(int,input().split()))
c = 0
for i in range(N):
    if H[i] >= K:
        c += 1
print(c)

Solution (Python):
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)

Solution (Python):
from bisect import bisect_left
n,k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
print(len(h[bisect_left(h, k):]))

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

total = 0
for i in range(len(h)):
    if h[i] >= k:
        total += 1
print(total)

Solution (Python):





import sys

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

def main():
    n, k = list(map(int,ipti().split()))
    h = list(map(int,ipti().split()))
    ans = 0

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

    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
N,K = map(int,input().split())
h = list(map(int,input().split()))
ans = [i for i in h if i >= K]
print(len(ans))

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

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

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

Solution (Python):
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)

Solution (Python):
n, k = map(int, input().split())
h = map(int, input().split())
lis_h = list(h)
cnt = 0
for h in lis_h:
    if h >= k:
        cnt += 1
print(cnt)

Solution (Python):
n,k=map(int,input().split())
h=list(map(int,input().split()))
count=sum(map(lambda x: x>=k, h))
print(count)

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

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

Solution (Python):
num = list(map(int,input().split()))
num_list = list(map(int,input().split()))

count = 0

for i in range(0,num[0]):
  if num_list[i] >= num[1]:
    count = count + 1
    
print(count)

Solution (Python):
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
for i in range(n):
  if h[i] >= k:
    i -= 1
    break
print(n-i-1)

Solution (Python):
N, K = map(int, input().split())
H = [int(h) for h in input().split()]

cnt = 0
for h in H:
    if h >= K:
        cnt += 1
print(cnt)

Solution (Python):
n , k = map(int,input().split())
hights = list(map(int,input().split()))
result = 0    
for hight in hights:
    if hight >= k:
        result += 1
        
print(result)

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

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

Solution (Python):


def main():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))
    print(len(list(filter(lambda x: x >= k, h))))

if __name__ == "__main__":
    main()

Solution (Python):
N, K = map(int, input().split())
H = list(map(int, input().split()))
ans = sum(h >= K for h in H)
print(ans)

Solution (Python):
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)

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

print(c)

Solution (Python):
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort(reverse=True)
ans=0
for i in range(n):
    if h[i]>=k:
        ans+=1
    else:
        break
print(ans)

Solution (Python):
N,K=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)

Solution (Python):
N,K = map(int,input().split())

h = [int(i) for i in input().split()]

count =0

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

Solution (Python):
n,k = map(int, input().split())
a = list(map(int, input().split()))

print(len([i for i in a if i>k-1]))

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

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


cnt = 0

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

print(cnt)

Solution (Python):
N, K = map(int, input().split())
hlist = list(map(int, input().split()))
cnt = 0

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

print(cnt)

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

p = 0
for i in h:
  if i >= k:
    p += 1
print(p)

Solution (Python):
import sys
input = sys.stdin.readline
N, K = map(int, input().split())
h = [int(x) for x in input().split()]

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

Solution (Python):
n,k = 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)

Solution (Python):
N,K=map(int,input().split())
H=list(map(int,input().split()))
print(sum(1 for h in H if h>=K))

Solution (Python):
N,K=map(int,input().split())
H=list(map(int,input().split()))
print(sum(h>=K for h in H))

Solution (Python):
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)

Solution (Python):
n, height = map(int, input().split())
hl = list(map(int, input().split()))
cnt = 0
for i in hl:
    if height <= i:
        cnt += 1

print(cnt)

Solution (Python):
n, height = map(int, input().split())
hl = list(map(int, input().split()))
cnt = 0
for i in hl:
    if height <= i:
        cnt += 1

print(cnt)

Solution (Python):
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)

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

Solution (Python):
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)

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