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

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

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

print(output)

Solution (Python):
N,i=map(int,input().split())
h=list(map(int,input().split()))
j=list(hi >= i for hi in h)
print(j.count(True))

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

L = [1 for i in range(N) if h[i] >= K]
print (len(L))

Solution (Python):

import sys

import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

n, k = readmi()
t = readl()
c = 0
for i in t:
    if i >= k:
        c += 1
print(c)

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

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

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

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

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

Solution (Python):






from sys import stdin,setrecursionlimit





setrecursionlimit(10**6)
input=stdin.readline

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

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

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, 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(i) for i in input().split()]
hs = [int(i) for i in input().split()]

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

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

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

ans = [1 for i in hi if i >=K]

print(sum(ans))

Solution (Python):




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

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

count = 0
h_sorted = sorted(hn)
h_sorted.reverse()

for h in h_sorted:
    if k <= h:
        count = count + 1
    else:
        break

print(count)

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

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

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())
list = input().split()
ans = 0

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

print(ans)

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

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

print(sum(1 for h in hs if h >= K))

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

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

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

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

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

cn=0

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

print(cn)

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):
import numpy as np
n, k = list(map(int, input().split()))
a = np.array(list(map(int, input().split())))
print((a>=k).sum())

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

cnt=0

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

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

ans = 0

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

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

cnt = 0
for h in H:
    if K <= h:
        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 = 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()))
cnt = 0
for i in range(N):
    if H[i] >= K:
        cnt += 1
    
print(cnt)

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


def readInts():
  return [int(s) for s in input().split(" ")]

def main():
  N, K = readInts()
  hs = readInts()
  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())
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()))
res = 0
for h in H:
  if h >= K:
    res += 1
print(res)

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

print(sum(1 for x in hs if k <= x))

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

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

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

output = 0

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

print(output)

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):
def resolve():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))
    ok = [1 if hi >= k else 0 for hi in h]
    print(sum(ok))


if __name__ == "__main__":
    resolve()

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

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

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

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().strip().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()))
    ans = 0
    for i in h:
        if i >= k:
            ans += 1
    print(ans)
    
if __name__ == '__main__':
    main()

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

ans=0
for i in range(n):
    if a[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 = 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()))
print(sum(1 if t >= K else 0 for t in h))

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

    ans = 0

    for i in h:
        if i >= 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 h in H:
    if h >= K:
        cnt += 1

print(cnt)

Solution (Python):
[n,k]=[int(x) for x in input().split()]
h=[int(x) for x in input().split()]
print(sum([item>=k for item in h]))

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,h= map(int,input().split())
h_list = input().split()
h_list = [int(one) for one in h_list]
num = 0
for one in h_list:
    if one >= h:
        num += 1
print(num)

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

ctn = 0
for i in h:
    if i >= k:
        ctn +=1

print(ctn)

Solution (Python):
if __name__ == '__main__':
    n, k = map(int,input().split())
    h_list = list(map(int,input().split()))

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

    print(answer)

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):
import sys
sys.setrecursionlimit(100000)

def ins(): return input().split()
def ii(): return int(input())
def iil(): return list(map(int,ins()))
def lin(): return list(input())
def iin(): return map(int,ins())

n,k = iin()
l = iil()
c = 0
for i in l:
    c = c+1 if i>=k else c
print(c)

Solution (Python):
def main():
    N, K, *h = map(int, open(0).read().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 = 0
for i in range(n):
    if h[i]>=k:
        ans += 1
print(ans)

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

counter = 0
for h in hlist:
    if h>=K:
        counter += 1

print(counter)

Solution (Python):
import sys
def main():
    input = sys.stdin.readline
    NK = list(map(int, input().split()))
    N = NK[0]
    K = NK[1]
    hs = list(map(int, input().split()))
    ans = 0
    for i in range(N):
        if hs[i] >= K:
            ans += 1
    print(ans)
if __name__ == '__main__':
    main()

Solution (Python):
N, K, *H = map(int, open(0).read().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()))
cnt=0
h.sort()
for i in range(N):
    if h[i]<K:
        cnt+=1
    else:
        break
print(N-cnt)

Solution (Python):
n,k = map(int, input().split())
hs = sorted(list(map(int, input().split())),reverse=True)
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 range(N):
    if K <= h[i]:
        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()))
ans = 0

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

Solution (Python):

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

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

print(c)

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

ans = 0
for h in a:
    ans += h >= k

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






import math
import statistics
import numpy as np

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

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

Solution (Python):
import sys

input = sys.stdin.readline

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

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    N, K = map(int, input().split())
    A = list(map(int, input().split()))

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

    return cnt

if __name__ == '__main__':
    print(main())

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 sys
input = sys.stdin.readline

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


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

ans = 0
for i in height:
    if i >= k:
        ans += 1

print(ans)

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

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

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

print(len(list(filter(lambda x: x >= k, 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):
import sys

stdin = sys.stdin

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

def main():
  n, k = na()
  h = list(na())
  cnt = 0
  for hh in h:  
    if hh >= k:
      cnt += 1
  print(cnt)

main()

Solution (Python):
input = raw_input


N,K = list(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):
''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''

gi = lambda : list(map(int,input().split()))
n, m = gi()
l = gi()
print(sum([1 if e >= m else 0 for e in l]))

Solution (Python):
import sys
from collections import defaultdict, deque
from functools import reduce
import math

input = sys.stdin.readline


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

if __name__ == '__main__':
    main()

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 range(N):
    if h[i] >= K:
        cnt+=1

print(cnt)

Solution (Python):

import sys


def solve(N: int, K: int, h: "List[int]"):
    print(len([i for i in h if i >= K]))
    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 = 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()))
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):
import numpy as np
n, k = map(int, input().split())
l = np.array(list(map(int, input().split())))
print(np.sum(l>=k))

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

Solution (Python):

import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def fi(): return float(input())
def mfi(): return map(float, input().rstrip().split())
def lmfi(): return list(map(float, input().rstrip().split()))
def li(): return list(input().rstrip())
def debug(*args, sep=" ", end="\n"): print("debug:", *args, file=sys.stderr, sep=sep, end=end) if not __debug__ else None
def exit(*arg): print(*arg); sys.exit()



def main():
    N, K = mi()
    A = lmi()
    cnt = 0
    for i in range(N):
        if A[i] >= K:
            cnt += 1
    print(cnt)
    return


if __name__ == '__main__':
    main()

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

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

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

count=0
for i in ls:
    if 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]))

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

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 h in H:
        if h >= K:
            ans += 1
    print(ans)
    
if __name__ == '__main__':
    main()

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())

def main():
    N,K = mis()
    h = lmis()
    print(sum(h[i]>=K for i in range(N)))


main()

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

Solution (Python):


import sys

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

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

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=[int(i) for i in input().split()]

H.sort()
H.reverse()

ans=0
for ta in H:
    if ta >= k:
        ans+=1
    else:
        break
print(ans)

Solution (Python):
import numpy as np
import math
import sys
sys.setrecursionlimit(10000000)

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


if __name__ == '__main__':
    main()

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())
A = list(map(int,input().split()))
A.sort()
idx = -1
for i in range(N):
    if A[i] >= K:
        idx = i
        break
if idx == -1:
    print("0")
else:
    print(str(N-idx))

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(x) for x in input().split()]
print(len([h for h in H if K <= h]))

Solution (Python):


import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def MI() : return map(int, input().split())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def chkprint(*args) : names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}; print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

N, K = MI()
H = LI()

ans = 0

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

print(ans)

Solution (Python):
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools, os, pdb
sys.setrecursionlimit(10**7)
from queue import PriorityQueue
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def _I(): return int(sys.stdin.readline())
def _F(): return float(sys.stdin.readline())
def _pf(s): return print(s, flush=True)
def perr(s): return print(s, file=sys.stderr)
N, K = LI()
H = LI()
ans=0
for h in H:
    if h >= K:
        ans +=1

print(ans)

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

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

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

print(cn)

Solution (Python):
n, k = list(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 = map(int, input().strip().split())

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

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

Solution (Python):

def solve():
    N, K = map(int, input().split())
    res = sum(h>=K for h in map(int, input().split())) 
    

    return str(res)

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

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

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

cnt=0
for item in r:
  if item>=k:
    cnt+=1
print(cnt)

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

print(len(h[h>=k]))

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline






















def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	N,K = inputMap()
	h = inputList()

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

	print(ans)


if __name__ == "__main__":
	main()

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

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

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

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

print(cnt)

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

ninzuu = 0

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

print(ninzuu)

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

a = 0
for hh in h:
    if hh >= k:
        a += 1
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):
def read():
    return int(input())

def readmap():
    return map(int, input().split())

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


if __name__ == "__main__":
    n , k = readmap()
    A = readlist()

    cnt = 0
    for a in A:
        if a >= k:
            cnt += 1
    
    print(cnt)

Solution (Python):



import sys, os
def ac_input(*args):
    return map(int, input().split())

def main():
    count = 0
    N, K = ac_input()
    tall = input().split()
    for n in range(N):
        if (int(tall[n]) >= K):
            count = count + 1
    print(count)
        

if __name__ == "__main__" :
    main()

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

def main():
    N, K = [int(x) for x in input().split()]
    h = [int(x) for x in 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()))

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

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

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

Solution (Python):

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

Tmp = []
Tmp = input().rstrip().split(' ')

Ans = 0
for i in range(N):
  TmpN = int(Tmp[i])
  if TmpN >= K:
    Ans += 1

print(Ans)

Solution (Python):

import sys


def solve(N: int, K: int, h: "List[int]"):
    count = 0
    for i in h:
        if i >= K:
            count += 1
    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()