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):
a,b=(int(x) for x in input().split())
X=input()
Y=X.split()
count=0

for i in range(len(Y)):
    if b<=int(Y[i]):
        count=count+1
    ++i
print(count)

Solution (Python):
NK = input().split(" ")
N = int(NK[0])
K = int(NK[1])
H = list(map(int,input().split(" ")))
result = 0

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

print(result)

Solution (Python):
import numpy as np
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()))
cnt=0
for i in range(len(h)):
    if h[i]>=K:
        cnt+=1
print(cnt)

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

h.sort()


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


print(N-i-1)

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

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=(int(x) for x in input().split())
h_list=list(map(int,input().split()))
counter=0
for i in range(n):
    if h_list[i] >= k:
        counter+=1
print(counter)

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

ans = 0

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

print(ans)

Solution (Python):
x,y = map(float,input().split())	
li = list(map(float,input().split()))	
count=0
for i in li:
    if(y <= i):
        count+=1
print(count)

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

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

ans = N
for i in range(N):
    if h[i] < K:
        ans = i
        break
print(ans)

Solution (Python):
import sys

n, k = map(int, raw_input().split(" "))
h = sorted(map(int, raw_input().split(" ")), reverse=True)

l = 0
r = len(h)-1
i = -1
while l<=r:
    i = (l+r)/2
    if k > h[i]:
        r = i-1
    elif k < h[i]:
        l = i+1
    else:
        break

while i<len(h) and h[i] >= k:
    i += 1

print i

Solution (Python):
a = []
a = input().split()
N = int(a[0])
K = int(a[1])

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

count = 0

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




print(count)

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

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

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 = list(map(int,input().split()))
array = list(map(int,input().split()))
ans = 0
i = 0
while N > i:
  if array[i] >= K:
    ans += 1
    
  i += 1
print(ans)

Solution (Python):
N, K = map(int, 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 range(N):
    if H[i]>=K:
        ans += 1

print(ans)

Solution (Python):
n,k=[int(s) for s in input().split()]
h_list=list(map(int,input().split()))

number=0

for i in h_list:
	if i >= k:
		number=number+1
	else:
		pass

print(number)

Solution (Python):
N, K = map(int, input().split())
A = [int(a) for a in input().split()]
count = 0
for a in A:
  if a >= K: 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())
h = list(map(int, input().split()))
cnt = 0
for i in range(n):
  if h[i] >= k:
  	cnt += 1
print(cnt)

Solution (Python):
A = input().split()
B = input().split()
member = 0
count = 0
for i in B:
    if int(i) >= int(A[1]):
        count += 1
    member += 1
    if int(member) >= int(A[0]):
        break

print(count)

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

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

Solution (Python):
N,K = map(int, raw_input().split())
H = map(int, raw_input().split())
A = sum([1 for h in H if h >= K])
print(A)

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

Solution (Python):
str = input().split()

n = int(str[0])
k = int(str[1])

str2 = input().split()

c = 0

for s in str2:
    i = int(s)
    if i >= k:
        c += 1

print(c)

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())
A=list(map(int, input().split()))
a=0
for i in A:
	if i>=K:
		a+=1
print(a)

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

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

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

Solution (Python):
tmp = input().split()
N = int(tmp[0])
K = int(tmp[1])
h = input().split()

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

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

Solution (Python):
N,K=map(int,input().split())
member=list(map(lambda x:int(x)>=K,input().split()))
print(member.count(True))

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

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

t = sum(x>=K for x in a)
print(t)

Solution (Python):
import numpy as np
N = list(map(int, input().split()))
A = list(map(int, input().split())) 
numb = N[0]
bord = N[1]

A_p =np.array(A)
count =0

for n in range(numb):
    if A_p[n] >= bord:
        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())
h = list(map(int, input().split()))
total = 0
for i in range(N):
  if h[i] >= K:
    total += 1
print(int(total))

Solution (Python):


def Roller_Coaster(N, K, member):
        a = list(filter(lambda x: x >= K, member))
        return len(a)

if __name__ == "__main__":
    [N, K] = list(map(int, input().split()))
    member = list(map(int, input().split()))
    print(Roller_Coaster(N,K,member))

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

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

list= [n for n in li if n>=k]

print(len(list))

Solution (Python):
n,k = input ().split(' ')

n = int(n)

k = int(k)

canRide = 0

friends = input().split(' ')

for i in range (n):
    if int(friends[i]) >= k:
        canRide += 1

print(canRide)

Solution (Python):

import sys
import os

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

hs = sorted(h)

s = 0

for i in range(n):
    if hs[i] >= k:
        break
    else:
        s += 1

print(n - s)

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

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

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

Solution (Python):
import numpy as np
n, k = (int(i) for i in input().split())
h = np.array([int(i) for i in input().split()])
print(sum(h >= k))

Solution (Python):
line_01 = input().split(" ")
line_02 = input().split(" ")

N = int(line_01[0])
K = int(line_01[1])
count = 0

for i in line_02:
  if int(i) >= K:
    count += 1
    
print(count)

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

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

n,k =na()
h =na()
h = sorted(h)

import bisect

m = bisect.bisect_left(h,k)
print(n-m)

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

print(sum(a >= K for a in vA))

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

Solution (Python):
N, K = [int(x) for x in raw_input().split(' ')]
H = [int(x) for x in raw_input().split(' ')]
H = [x for x in H if x >= K]
print(len(H))

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

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

Solution (Python):
n = input().rstrip().split(" ")
m = input().rstrip().split(" ")
j = 0

for i in range(int(n[0])):
	if int(m[i]) >= int(n[1]):
   	    j += 1
        
print(j)

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

hh = [x for x in h if x>=K]
print(len(hh))

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

Solution (Python):
nk = input().split(" ");
n = int(nk[0]);
k = int(nk[1]);
h = input().split(" ");
for i in range(n) :
	h[i] = int(h[i]);



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 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:
    ans += (i >= K)
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())
list_height = list(map(int, input().split()))

cnt = 0

for x in range(0, n):
    if list_height[x] >= k:
        cnt += 1

print(cnt)

Solution (Python):
inp = []
inp = input().split()
N = int(inp[0])
K = int(inp[1])
hin = []
hin = input().split()
mem = 0
for h in hin:
  if int(h) >= K:
    mem += 1
print(mem)

Solution (Python):
import numpy as np

n, k=[int(i) for i in input().split()]
h_list = np.array([int(i) for i in input().split()])

print((h_list >= k).sum())

Solution (Python):
N,K = map(int,input().split())
H = list(map(int, input().split()))
import bisect
H.sort()
index = bisect.bisect_left(H,K)
print(len(H)-index)

Solution (Python):
adn,yui=(int(i) for i in input().split())
gumi = [int(i) for i in input().split()]

ans = 0
for i in range(len(gumi)):
    if(yui<=gumi[i]):
        ans+=1
        
print(ans)

Solution (Python):
import numpy as np
 
N, K = map(int, input().split())
h_i = list(map(int, input().split()))
h_i = np.array(h_i)
can_ride = h_i[h_i>=K]
print(len(can_ride))

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

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


if __name__ == "__main__":
    main()

Solution (Python):
n, k = map(int, input().split())
h = sorted(map(int, input().split()), reverse = True)
cnt = 0
for l in h:
    if(k <= l):
        cnt += 1
print(cnt)

Solution (Python):
import sys
from collections import Counter, deque, defaultdict
from math import factorial
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

n, k = MAP()
h = LIST()
count = 0
for i in h:
    if i >= k:
        count += 1
print(count)

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

Solution (Python):
import sys


def input():
    return sys.stdin.readline().rstrip()


def main():
    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)


if __name__ == '__main__':
    main()

Solution (Python):
N, H = map(int,input().split(' '))
H_list = list(map(int,input().split(' ')))
count = 0

for i in H_list:
    if i >= H:
        count += 1
    
print(count)

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

H = [int(h) for h in input().split()]
H.sort(reverse=True)

for i in range(N):
    if H[i] < K:
        print(i)
        exit()
print(N)

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

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

import bisect
print(n- bisect.bisect_left(l, h))

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

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

h = list(map(int, input().split()))
cnt = 0
h.sort(reverse=True)

for height in h:
	if height >=k:
		cnt+=1
	else:
		print(cnt)
		exit()
print(cnt)

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

s = 0
for h in hlist:
    if h >= k:
        s += 1
print(s)

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

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

Solution (Python):


n,k = map(int, raw_input().split())
li = map(int, raw_input().split())

li.sort(reverse=False)

count = 0

for i in xrange(0,n):
    if li[i] >= k:
        count += 1
    else:
        continue

print count

Solution (Python):

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

friends.sort(reverse=True)
ans = 0

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

print(ans)

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

Solution (Python):
_, b = map(int, input().split())
a = list(map(int, input().split()))
cnt = 0
for me in a:
    if me >= b:
        cnt = cnt + 1
print(cnt)

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

for i in data:
  if i >= k:
    s += 1

print(s)

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

Solution (Python):
def sub_b():
    n, k = map(int, input().split())
    hs = list(map(int, input().split()))

    ret = 0
    for h in hs:
        if h >= k:
            ret += 1
    print(ret)


if __name__ == '__main__':
    sub_b()

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

result = 0
for h in h_n:
    if h >= k:
        result += 1
    
print(result)

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

Solution (Python):
if __name__ == "__main__":
	i = list(map(int, input().split()))
	h = list(map(int, input().split()))

	n = i[0]
	k = i[1]

	count = 0

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

	print(count)

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

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
    else:
        continue

print(count)

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()))
sum = 0
for i in range(n):
  if(h[i]>=k):
    sum+=1
print(sum)

Solution (Python):
N = [int(i) for i in input().split()]
K = [int(i) for i in input().split()]
number = 0
for n in range(0, N[0]):
    if K[n] >= N[1]:
        number += 1

print(number)

Solution (Python):
args = input().split()
heights = input().split()

b = [x for x in heights if int(x) >= int(args[1])]
print(len(b))

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

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 = list(map(int,input().split()))
h = [i for i in list(map(int,input().split())) if i >= n[1]]
print(len(h))

Solution (Python):


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

h.sort()
if h[len(h)-1]<K:
    print(0)
else:
    for i in range(len(h)):
        if h[i]>=K:
            print(N-i)
            break

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()))

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

print(num)

Solution (Python):
N, K = map(int, input().split())
h = list(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())
li = list(map(int, input().split()))

count = 0
for h in li:
    if h >= k:
        count = count + 1
print(count)

Solution (Python):
n, k = (int(_) for _ in input().split())
h = [int(_) for _ 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 range(N):
  if K-1 < h[i]:
    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()))
cnt = 0

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

print(cnt)

Solution (Python):
import bisect

N,K = [int(x) for x in input().split()]
height = [int(x) for x in input().split()]
height.sort()

i = bisect.bisect_left(height, K)
print(N - i)

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


res = 0
for e in h:
	if e >= k:
		res += 1
print(res)

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

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


ans = 0

for height in heights:
    if height >= k:
        ans += 1
print(ans)

Solution (Python):
_, required_height = map(int, input().split(' '))

heights = list(map(int, input().split(' ')))
accepted = [h for h in heights if h >= required_height]

print(len(accepted))
exit(0)

Solution (Python):
n, k = map(int, input().split())
h = list(map(int, input().split()))
h_s = sorted(h, reverse = True)
ans = n
for i in range(n):
    if h_s[i] < k:
        ans = i
        break
print(ans)

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

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

H.sort()

for j in range(N):
    if(H[j] < K):
        continue
    else:
        print(N - j)
        break

else:
    print(0)

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

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

ans = 0

for kid in kids:
    if kid >= 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 k <= h[i]:
        count += 1

print(count)

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

count = 0

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

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

person = 0
for n in range(N):
    if int(h_list[n]) >= K:
        person+=1
    
print(person)

Solution (Python):
n,k = map(int, input().split())
members = [int(i) for i in input().split()]
res = 0
for member in members:
  if member >= 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):

import sys


def solve(N: int, K: int, h: "List[int]"):
    count = 0
    for i in range(N):
        if h[i] >= K:
            count += 1
        else:
            pass
    print(count)

    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()))

ans = len(list(filter(lambda x: x >= K, h)))
print(ans)

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

num = 0

for height in h:
    if height >= K:
        num += 1

print(num)

Solution (Python):
n, k = map(int, input().split())
A = sorted([int(x) for x in input().split()])
c=0
for i in range(n):
  if(A[i]<k):
    c+=1
  else:
    break
print(n-c)

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

cnt=0

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

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

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

ctr = 0

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

Solution (Python):

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

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

print(count)

Solution (Python):


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

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

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

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

print(count)

Solution (Python):
N,K = map(int,input().split())
H = 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())
count = 0
for h in input().split():
    if int(h) >= K:
        count += 1
print(count)

Solution (Python):
N, K = map(int, input().split(" "))
heightlist = list(input().split(" "))
ans = 0
for i in range(N):
  if int(heightlist[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):
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, 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)

Solution (Python):

inputNum = list(map(int, input().split()))
H = list(map(int, input().split()))

result = [h for h in H if h >= inputNum[1]]

print(len(result))

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

h.sort(reverse=True)
cnt = 0

for i in h:
    if k <= i:
        cnt = cnt + 1
    else:
        break

print(cnt)

Solution (Python):
n,k = map(int,input().split())
l = [int(i) for i in input().split()]
ans = 0
for i in l:
    if i >= k:
        ans += 1
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()))  

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

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

Solution (Python):
tmp=input().split()
Tall=input().split()

N=tmp[0]
K=int(tmp[1])

Ans=0
i=0
for i in Tall: 
  if int(i)>=K:
    Ans=Ans+1
print(Ans)

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

H = input().split()


ans = 0
for h in H:
    if int(h) >= K:
        ans +=  1

print(ans)

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

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

print(n)

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

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

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

ans = 0

for i in range(len(H)):
  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 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()))
p=0
for i in a:
    if i>=k:
        p+=1
print(p)

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):
a,b=map(int, input().split())
c = list(map(int, input().split()))
d = 0
for i in c:
  if b <= i:
    d += 1
print(d)

Solution (Python):
_, k = map(int, input().split())
h = map(int, input().split())
print(len(list(filter(lambda x: x >= k, h))))

Solution (Python):
s = input().split()
hs = input().split()
n, k = int(s[0]), int(s[1])
accepted = 0

for h in hs:
  if int(h) >= k:
    accepted += 1
print(accepted)

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

Solution (Python):
from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby




'''
条件に合うものを絞り込む
data = [1, 2, 3]
s = [x for x in data if x % 3 == 0]
'''

'''
文字配列を数値に
l_si = ['-10', '0', '100']

l_si_i = [int(s) for s in l_si]
'''

'''
a = [2, 4, 6, 8]
b = [3, 6, 9]

print(list(set(a) | set(b)))  
print(list(set(a) & set(b)))  
'''

'''
N = int(stdin.readline().rstrip())
A = [int(x) for x in stdin.readline().rstrip().split()]
count = 0
while len([x for x in A if x % 2 == 0]) == N:
    A = list(map(lambda y: y / 2, A))
    count += 1
print(count)
'''

'''
.append(要素)
.insert(場所,要素)
-1で末尾で末尾から一つ前
'''


get = stdin.readline().rstrip().split()
N = int(get[0])
K = int(get[1])
people = stdin.readline().rstrip().split()
res = len([x for x in people if int(x) >= K])
print(res)

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

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

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

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

print(cnt)

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())
tall = list(map(int,input().split()))
count = 0
for person in tall:
  if person >= K:
    count += 1
    
print(count)

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

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

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().rstrip().split())
Hs = map(int, input().rstrip().split())
print(len([x for x in Hs if x >= K]))

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

H = map(int,input().split())

cnt = 0

cnt = len([1 for h in H if h >= K])

print(cnt)

Solution (Python):

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

print(c)

Solution (Python):
n,limit = map(int,input().split())
li = input().split()
h_list = [int(li[i]) for i in range(n)]

answer = 0
for i in range(n):
    if h_list[i] >= limit:
        answer = answer + 1
print(answer)

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

a = [i  for i in H if i >= K]
print(len(a))

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())
a = list(map(int,input().split()))
a.sort()
flag = 0

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

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 = input().split()
n = int(N)
k = int(K)
hList = input().split()

count = 0
for i in range(0,n):
    if int(hList[i]) >= k:
        count += 1
print(count)

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