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

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

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

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

print(cnt)

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):
inStr = input()
splitStr = inStr.split()
N = int(splitStr[0])
K = int(splitStr[1])

inStr = input()
splitStr = inStr.split()
ans = 0
for i in range(N):
    if int(splitStr[i]) >= K:
        ans += 1

print(ans)

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

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

Solution (Python):
NK = input().split(" ")
height = input().split(" ")
ans = 0
for i in height:
  if int(NK[1]) <= int(i):
    ans = ans + 1
print(ans)

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

Solution (Python):
n,k = map(int,input().split())
h = [int(i) for i in input().split()]
ans = sum(1 for i in range(n) if h[i] >= k)
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())
a_L = list(map(int,input().split()))

counter = 0
for val in range(n):
    if int(a_L[val]) >= int(k):
        counter += 1
print(counter)

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

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

Solution (Python):
N,K =map(int,input().split())
h = list(map(int,input().split()))
h = sorted(h)
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):
n,k = list(map(int, input().split()))
hlst = list(map(int, input().split()))
ct = 0
for i in hlst:
    if i>= k:
        ct += 1
print(ct)

Solution (Python):
n, k = map(int, input().split())
h = [int(i) for i in 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())

length = list(map(int, input().split()))
ans = 0

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

print(ans)

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

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

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

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

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

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

Solution (Python):
def q_B(N, K, arrH):
	count = 0
	for i in range(N):
		if arrH[i] >= K:
			count += 1
	print(count)

N, K = map(int, input().split())
arrH = [int(x) for x in input().split()]
q_B(N, K, arrH)

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

h.sort(reverse = 1)

cnt = 0

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

print(cnt)

Solution (Python):

import sys


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



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())
a = list(map(int,input().split()))
a.sort(reverse=True)
s = 0
for i in range(n):
    if a[i] >= k:
        s += 1
    else:
        print(s)
        exit(0)
print(s)

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 = [int(v) for v in input().split(' ')]
H = [int(v) for v in 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 range(n):
    if h[i] >= k:
        ans += 1
print(ans)

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

Solution (Python):
N,K=map(int,input().split())
H=list(map(int,input().split()))
l=len(H)
H.sort(reverse=True)
c=0
i=0
while H[i]>=K:
  c=c+1
  i=i+1
  if i>(l-1):
    break
print(c)

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()))
ans = 0
for e in h:
    if e >= K:
        ans += 1
print(ans)

Solution (Python):
n_k = input().rstrip().split(' ')

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

h_list = input().rstrip().split(' ')
cnt = 0

for h in h_list:
  if int(h) >= K:
    cnt += 1
  
print(cnt)

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

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

Solution (Python):
i1 = input()
i2 = input()

i1 = i1.split()
n = int(i1[0])
k = int(i1[1])

i2 = i2.split()

cnt = 0
for i in i2:
  cnt += 1 if int(i) >= k else 0

print(str(cnt))

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

goukei = 0
for i in range(len(array)):
	if array[i] >= k:
		goukei += 1

print(goukei)

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

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

cnt = 0
for c in h :
        if(c>=k) :
                cnt += 1

print(cnt)

Solution (Python):
n,k=map(int,input().split())
h=list(map(int,input().split()))
ans=sum(x>=k for x 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
  else:
    count += 0

print(count)

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

Solution (Python):


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

h = [int(e) for e in input().split()]
a = 0
for i in range(N):
  a += h[i] >= K
print('{}'.format(a))

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

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

print(counts)

Solution (Python):
a,b = map(int,input().split())
c = input().split()
counter = 0
for val in c:
    if int(val) >=b:
        counter += 1
print(counter)

Solution (Python):


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

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

reversed_list = sorted(h_list)[::-1]

num = 0
for h in reversed_list:
    if h < K:
        break
    num += 1

print(num)

Solution (Python):
N, K = [int(s) for s in input().split()]
H = [int(s) for s in 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())
h=list(map(int,input().split()))
ans=0

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

print(ans)

Solution (Python):
import math
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 = map(int, input().split())
h = list(map(int,input().split()))
count = 0

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

    else:
        pass

print(count)

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

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

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

Solution (Python):

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

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

Solution (Python):
N_K = list(map(int,input().split()))
h = list(map(int,input().split()))
h.sort()

for i in range(N_K[0]):
    if h[i] >= N_K[1]:
        print(N_K[0]-i)
        break
    elif i == (N_K[0]-1):
        print(0)

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 = [int(i) for i in input().split()]
cnt = 0
for i in h:
    if i >= k:
        cnt += 1
print(cnt)

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


if __name__ == "__main__":
    main()

Solution (Python):

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

Solution (Python):


def main():
    N, K = map(int, input().split())
    h = list(map(int, input().split()))
    print(sum(1 for i in h if i >= K))


if __name__ == '__main__':
    main()

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

n,k=map(int,input().split())
l=list(map(int,input().split()))
c=0
for i in range(n):
    if l[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):
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()))

ans = 0

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

print(ans)

Solution (Python):
import sys

n, k = map(int, sys.stdin.readline().split())

a = list(map(int, sys.stdin.readline().split()))

print(len(list(filter(lambda x:x >= k, a))))

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 main():
    N, K = input().split()
    N, K = int(N), int(K)

    can_ride = 0
    for h in input().split():
        if int(h) >= K:
            can_ride += 1
    print(can_ride)

main()

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

ans = 0
for h in h_li:
    if h >= k:
        ans += 1
print(ans)

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

Solution (Python):
from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys
import random
import itertools
import math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt


def LI(): return list(map(int, input().split()))


def LF(): return list(map(float, input().split()))


def LI_(): return list(map(lambda x: int(x)-1, input().split()))


def II(): return int(input())


def IF(): return float(input())


def LS(): return list(map(list, input().split()))


def S(): return list(input().rstrip())


def IR(n): return [II() for _ in range(n)]


def LIR(n): return [LI() for _ in range(n)]


def FR(n): return [IF() for _ in range(n)]


def LFR(n): return [LI() for _ in range(n)]


def LIR_(n): return [LI_() for _ in range(n)]


def SR(n): return [S() for _ in range(n)]


def LSR(n): return [LS() for _ in range(n)]


mod = 1000000007
inf = float('INF')


def A():
    a = II()
    b = a//2
    p = b/a
    if a % 2:
        print(1-p)
    else:
        print(p)

    return




def B():
    N, K = map(int, input().split())
    h = LI()
    count = 0

    for i in h:
        if i >= K:
            count += 1
        else:
            continue
    print(count)
    return




def C():
    n, k, q = LI()
    d = [0] * n
    for _ in range(q):
        a = II() - 1
        d[a] += 1
    for a in d:
        if k - (q - a) > 0:
            print("Yes")
        else:
            print("No")
    return




def D():
    n, = LI()
    a = LI()
    q = []
    for ai in a:
        heappush(q, ai)
    for _ in range(m):
        heappush(q, heappop(q) / 2)
    ans = 0
    while q:
        ans += int(heappop(q))
    print(ans)
    return




def E():
    return




def F():
    return



if __name__ == '__main__':
    B()

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

Solution (Python):
n, K = map(int, input().split())
ls = list(map(int, input().split()))
tot = 0
for i in ls:
    if i >= K:
        tot += 1
print(tot)

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('{0}'.format(cnt))

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

    
for a in h:
  if(a >= k):
    ans += 1
  
print(ans)

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

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

Solution (Python):
n, k, *h = map(int, open(0).read().split())

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

print (ans)

Solution (Python):
n = input().split(" ")
a = input().split(" ")
b = [int(i) for i in a]
c =[i for i in b if i>=int(n[1])]
print(len(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 += 1
    else:
        pass

print(cnt)

Solution (Python):

split = input().split(" ")
N = int(split[0])
K = int(split[1])

Hi = [0 for i in range(N)]
split = input().split(" ")

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

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

Solution (Python):
inp1 = input().split()
inp2 = input().split()

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

cnt = 0

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

Solution (Python):
a = list(input().split(" "))
h = list(input().split(" "))

lider = []
for h_s in h:
    if int(h_s) >= int(a[1]):
        lider.append(h_s)

print(len(lider))

Solution (Python):
N, K = tuple(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=[int(i) for i in input().split()]
ans=[i for i in input().split() if int(i)>=k]
print(len(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 = count + 1
print(count)

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

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

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

indexes = [i for i, v in enumerate(h) if v >= K]

print(len(indexes))

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

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

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

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

    c = 0

    for hh in h:
        if hh >= K:
            c += 1

    print(c)

if __name__ == "__main__":
    main()

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

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

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

cnt = 0
for i in range(N):
    if K <= h[i]:
        cnt = cnt + 1
    else:
        pass  

print(cnt)

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

print(sum(x >= k for x in h))

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 = [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 = list(map(int, input().split()))

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

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

Solution (Python):
import numpy as np

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

counter = 0

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

print(counter)

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

c = 0
for hi in h:
    if hi >= k:
        c += 1

print(c)

Solution (Python):

from sys import stdin

N, K = [int(x) for x in stdin.readline().rstrip().split()]
hs = stdin.readline().rstrip().split()
ans = 0
for i in range(N):
    hight = int(hs[i])
    if hight >= K:
        ans += 1
    else:
        pass

print(ans)

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

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

print(a)

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

    ans = 0
    for h in hs:
        if h >= k:
            ans += 1

    print(ans)


if __name__ == "__main__":
    main()

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

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

a=0

for h in li:
  if h >= K:
    a += 1

print(a)

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

for i in h:
  if N[1] <= i:
    counter = counter + 1

print(counter)

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

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

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

print(str(result))

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

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 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 height in h:
    if height >= k:
        count += 1
print(count)

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())
h = list(map(int, input().split()))

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

print(count)

Solution (Python):
x = [int(x) for x in input().split()]
y = [int(x) for x in input().split()]
c=0
for i in range(x[0]):
  if y[i]>=x[1]:
    c+=1
    continue
print(c)

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

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

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

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

print(sum([t >= K for t in h]))

Solution (Python):

import sys


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

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

print(ans)

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

ans = 0

for h in hs:
  if k <= h:
    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()))
a = 0

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

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

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

N, K = map(int, input().split())
h = list(map(int, input().split()))
h.append(K)
h.sort()
ans = h.index(K)
print(N - ans)

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

h=[]
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
N, K = [int(v) for v in input().split()]
H = [int(v) for v in sys.stdin.readline().split()]

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

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

Solution (Python):
from bisect import bisect_left,bisect

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

h.sort()
index = bisect_left(h, K)
print(N - index)

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

print(len(list(filter(lambda x: x >= k, h_list))))

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):
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())
A = [int(x) for x in input().split()]
cnt = 0
for i in A:
    if K <= i:
        cnt += 1
print(cnt)

Solution (Python):


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

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

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

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([1 for i in h if i>=k]))

Solution (Python):
n, k = map(int,input().split())
h = list(map(int,input().split()))
h.sort(reverse = True)
ans = 0

for i in h:
    if(i >= k):
        ans += 1
    else:
        break
print(ans)

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

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

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

print(count)

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

count = 0

for l in li:
    if l >= K:
        count += 1

print(count)

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

ans = len(list(filter(lambda hi: k <= hi, h)))
print(ans)

Solution (Python):
import numpy as np

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

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

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

Solution (Python):

import sys

def solve():
    N, K = list(map(int, sys.stdin.readline().split()))
    hs = list(map(int, sys.stdin.readline().split()))

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

    print(ans)

if __name__ == "__main__":
    solve()

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):
size,h = list(map(int,input().split()))
li = list(map(int,input().split()))
count = 0
for i in li:
    if i>=h:
        count += 1
print(count)

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())
h = list(map(int, input().split()))

h.sort(reverse=True)

count = 0

for hi in h:

    if hi >= K:
        count += 1
    else:
        break

print(count)

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

cnt = 0

for h in hs:
  if h >= k:
    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):
def main():
    N, K = map(int, input().split())
    corster_list = [int(i) for i in input().split()]
    result = 0

    for corster in corster_list:
        if(corster>=K):
            result+=1

    print(result)


if __name__ == "__main__":
    main()

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

h.sort(reverse=True)
count = 0

i = 0
while i <= N-1:
  if h[i] >= K:
    count += 1
    i += 1
  
  else:
    break

print(count)

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

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

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 = input().split()
n = [int(i) for i in input().split()]
a = 0
for i in n:
    if i >= int(k):
        a += 1
print(a)

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):
def test():
    n,k = map(int,input().split())
    h = list(map(int,input().split()))
    print(sum([i>=k for i in h]))


if __name__ == "__main__":
    test()

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

print(count)

Solution (Python):
from collections import defaultdict
from collections import deque
from string import ascii_uppercase
import sys, bisect, math, heapq

stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()

N, K = read_int()
h = read_int()
h.sort()

def bisect_find_ge(a, x):
    'Find leftmost item greater than or equal to x'
    i = bisect.bisect_left(a, x)
    
    return i
    

def solve():
    ans = N - bisect_find_ge(h, K)
    return ans

if __name__ == "__main__":
    print(solve())

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


count = 0
for h in hs:
	if K <= h:
		count += 1
		
print(count)

Solution (Python):
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
i = 0
while h[i] < k :
	i += 1
	if i >= len(h) : break
print(n - i)

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

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

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

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

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)