Problem:
 Score : 200 points    Problem Statement  N friends of Takahashi has come to a theme park.  To ride the most popular roller coaster in the park, you must be at least K centimeters tall.  The i -th friend is h_i centimeters tall.  How many of the Takahashi's friends can ride the roller coaster?      Constraints   1 \le N \le 10^5  1 \le K \le 500  1 \le h_i \le 500  All values in input are integers.         Input  Input is given from Standard Input in the following format:  N  K  h_1  h_2  \ldots  h_N       Output  Print the number of people among the Takahashi's friends who can ride the roller coaster.        Sample Input 1 4 150
150 140 100 200      Sample Output 1 2  Two of them can ride the roller coaster: the first and fourth friends.       Sample Input 2 1 500
499      Sample Output 2 0       Sample Input 3 5 1
100 200 300 400 500      Sample Output 3 5

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

Sum = 0

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

Solution (Python):

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

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

List = []
for i in range(n):
    if h[i] >= k:
        List.append(h[i])

print(len(List))

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

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

r = list(filter(lambda x: x >= K, U))

print( len(r) )

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 = ans +1

print(ans)

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

Solution (Python):


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

num_of_can_ride = 0

for hi in H:
    if hi >= K:
        num_of_can_ride += 1

print(num_of_can_ride)

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()))
count = 0

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

print(count)

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

Solution (Python):




def I(): return int(input())


def IsIl(): return list(map(lambda x: int(x), input().split()))


def InIl(n): return [input() for i in range(n)]


def IsIt(): return map(lambda x: int(x), input().split())


def InIl(n): return map(input() for i in range(n))


def SsSl(): return list(map(lambda x: x, input()))




def SSd():
    from collections import defaultdict
    A = input() 
    dd=defaultdict(int)
    for a in A:
        dd[a]+=1
    return dd






n,k = IsIt()

lis_h = IsIl()

ans = 0
for i_h in lis_h:
    if i_h >= k:
        ans += 1


print(ans)

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

Solution (Python):
import bisect
n, k = map(int, input().split())
h0 = list(map(int,input().split()))
h = sorted(h0)
x = bisect.bisect_left(h, k)
print(n-x)

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

print(sum(map(lambda x: x >= k, h)))

Solution (Python):
n,k = map(int,input().split())
h = list(map(int,input().split()))
print(sum(a>=k for a 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):
user_input, acceptable_height = input().split(" ")
user_input = int(user_input)
acceptable_height = int(acceptable_height)
friend_height = input().split(" ")
for index, value in enumerate(friend_height):
    friend_height[index] = int(value)

for i in friend_height:
    if i < acceptable_height:
        user_input -= 1
print(user_input)

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

for x in range(0, N):
    if(K<=h[x]):
        count+=1

print(count)

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

Solution (Python):
s,t=(int(x) for x in input().split())
n=list(map(int,input().split()))
k=0
for i in range(s):
    if t<=n[i]:
        k+=1
print(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):
a,b=map(int, input().split());print(len([i for i in map(int, input().split()) if i >= b]))

Solution (Python):
N = input().split()
h = input().split()
 
count=0
for x in h:
    if(int(x)>=int(N[1])):
        count+=1

print(count)

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

print(count)

Solution (Python):
N = input().split()
i = input().split()

count=0
for j in i:
    if(int(j)>=int(N[1])):
        count+=1

print(count)

Solution (Python):
[n, k] = input().split()
heights = input().split()
if int(n) == len(heights):
  count = sum(1 for i in heights if int(i) >= int(k))
  print(count)

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

count=0
for i in range(N):
  if K<=int(H[i]):
    count=count+1

print(count)

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

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

print(num_friends)

Solution (Python):
from bisect import bisect_left

n,k = [int(x) for x in input().split()]
h = list(sorted(map(lambda x: int(x),input().split())))

print(n - bisect_left(h,k))

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

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

print(count)

Solution (Python):
n, t = map(int, raw_input().split())
a = map(int, raw_input().split())
popo = 0
for i in range (len(a)):
    if int(a[i]) >= t:
        popo += 1

print popo

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

count = 0

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

print(count)

Solution (Python):
N,K=map(int,input().split())
h=list(map(int,input().split()))
n=0
i=0
while n<N:
    if h[n]>=K:
        i+=1
        n+=1
    else:
        n+=1
print(i)

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

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

Solution (Python):

import sys, math, itertools, heapq, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

n,k=map(int,input().split())
h=list(map(int,input().split()))
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()))
h=sorted(h)
left=-1
right=len(h)
while right-left>1:
  mid=(right+left)//2
  if h[mid]>=K:
    right=mid
  else:
    left=mid
print(len(h)-left-1)

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

Solution (Python):
N,K=map(int,input().split())
h=list(map(int,input().split()))
h=sorted(h)
right=-1
left=len(h)
while left-right>1:
  mid=(right+left)//2
  if h[mid]>=K:
    left=mid
  else:
    right=mid
print(len(h)-left)

Solution (Python):
N_K = input()
N , K = N_K.split(" ")
N = int(N)
K = int(K)
H = input()
H = H.split(" ")
H = map(lambda x: int(x), H)
i=0
for hi in H:
    if hi>=K:
        i = i +1
print(i)

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

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

Solution (Python):
nk = input().split(' ')
n = int(nk[0])
k = int(nk[1])

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

h.sort()

if h[0] >= k:
	print(n)

elif h[n-1] < k:
	print(0)

else:
	m = n//2
	m_min = 0
	m_max = n-1
	while m_min != m:
		if h[m] < k:
			m_min = m
		else:
			m_max = m
		m = (m_min+m_max)//2
	
	print(n-m-1)

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

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

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

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

Solution (Python):
l=list(map(int,input().split()))
hei=list(map(int,input().split()))
a=l[0]
b=l[1]
cnt=0
for h in hei:
  if(b<=h):
    cnt+=1
print(cnt)

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

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

ok_counter = 0
for hi in heights:
    if hi >= K:
        ok_counter += 1
        
print(ok_counter)

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

Solution (Python):
N,K=map(int,input().split())
h=list(map(int,input().split()))
ans=0
for 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 = map(int, input().split())
h = [int(i) for i in input().split()]
import numpy as np
h = np.array(h)
print(len(h[h>=k]))

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

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

ans = 0

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

print(ans)

Solution (Python):
import numpy as np
N, K = input().split()
h = np.array(input().split()).astype(int)
print((h >= int(K)).astype(int).sum())

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

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

h.sort()

import bisect

a=bisect.bisect_left(h,K)
print(len(h[a:]))

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

h.sort()

import bisect

a=bisect.bisect_left(h,K)
print(len(h[a:]))

Solution (Python):
class RollerCoaster:
  def __init__(self):
    self.n, self.k = list(map(int,input().split(' ')))
    self.h = list(map(int,input().split(' ')))
    self.count = 0
  def solve(self):
    for i in self.h:
      if i >= self.k:
        self.count += 1
    print(self.count) 
    
                    
solver =  RollerCoaster()
solver.solve()

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

cnt =0

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

print(cnt)

Solution (Python):
import numpy as np
N, K = map(int, raw_input().split())
H = np.array(map(int, raw_input().split()))

print np.sum(H>=K)

Solution (Python):
K=int(input().split()[1]);print(sum(h>=K for h in map(int,input().split())))

Solution (Python):
K=int(input().split()[1]);print(sum([h>=K for h in map(int,input().split())]))

Solution (Python):
K=int(input().split()[1]);print(sum([1for h in map(int,input().split())if h>=K]))

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

count = 0

for member_height in members:
  if member_height >= 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 = 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):
r = lambda : map(int, input().split())

n,k=r()
a = list(r())

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

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

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

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

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

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

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

Solution (Python):
n, k = map(int, raw_input().split())
a = map(int, raw_input().split())
count = 0
for e in a:
    if k <= e:
        count += 1
print count

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().split())
h = list(map(int, input().split()))
ans = sum(map(lambda x: x >= k, h))
print(ans)

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

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

for i in li:
  if i >= k:
    count += 1
  else:
    continue
    
print(count)

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

c = 0

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

print(c)

Solution (Python):
N, K = map(int, input().split())
h = 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):
import sys
if sys.platform =='ios':
	sys.stdin=open('Untitled.txt')
input = sys.stdin.readline

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

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

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n, k = list(map(int, readline().split()))
    h = list(map(int, readline().split()))
    cnt = 0
    for i in range(n):
        if h[i] >= k:
            cnt += 1
    print(cnt)


if __name__ == '__main__':
    solve()

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

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

ans = 0

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

print(ans)

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

Solution (Python):
S = map(lambda x: int(x),input().split(" "))
A = list(S)
K = A[1]
T = map(lambda x: int(x),input().split(" "))
h = list(T)
count = 0
for i in h:
  if i>=K:
    count += 1
print(count)

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

allowed_to_ride = sum([1 for i in friends_size if i >= K])

print(allowed_to_ride)

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

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

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

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve(N, K, H):
    ans = 0
    for i in range(N):
        ans += H[i] >= K
    return ans


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

    print(solve(N, K, H))


if __name__ == '__main__':
    main()

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(n):
    if h[i] >= k:
        ans += 1
print(ans)

Solution (Python):
n,k=map(int,input().split())
ans=0
h=list(map(int,input().split()))
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()]
buf = 0 

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

print(buf)

Solution (Python):

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

the_number_can_ride = 0

for height in h:
    if height >= k:
        the_number_can_ride += 1

print(the_number_can_ride)

Solution (Python):
import bisect
n,k = map(int,input().split())
h = sorted(map(int,input().split()))
print(n - bisect.bisect_left(h,k))

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

Solution (Python):

import sys














def main():
    n, k, *h = [int(x) for x in sys.stdin.read().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 i in range(N):
    if H[i] >= K:
        ans += 1
print(ans)

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

h = map(int,input().split())
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()))
H.sort()
HAKO = []
for i in range(N):
    if H[i] >= K:
        HAKO.append(H[i])
print(len(HAKO))

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

ans = 0
for m in H:
    if m >= k: ans += 1
print(ans)

Solution (Python):

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

A=list(map(int, input().split()))
count=0

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

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


N, K = inpl()
H = inpl()

print(sum(h >= K for h in H))

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

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

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

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

for i in range(n):
    if lis[i]>=k:
        a.append(lis[i])

print(len(a))

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

index = bisect.bisect_left(li,k)
print(n-index)

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

print(p)

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

Solution (Python):
n,k=map(int,input().split())
h=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()))
h.sort(reverse=True)
a=0
for i in h:
  if i>=K:
    a+=1
  else:
    break
print(a)

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

Solution (Python):

import sys, math
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans=count=0


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

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

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

    print(cnt)

if __name__ == '__main__':
    abc142_b()

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

if __name__ == '__main__':
    abc142_b()

Solution (Python):
a,b=map(int,input().split())
h=list(map(int,input().split()))

ans=0

for i in h:
    if i>=b:
        ans+=1
        
print(ans)

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

print(sum)

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

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

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

Solution (Python):
N, K = (int(i) for i in input().split())
H = [int(i) for i in input().split()]
H.sort(reverse=True)
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(y) for y in input().split()]
leng=len(h)
counter=0
for i in range(1,leng+1):

    if h[i-1]>=k:
        counter+=1
print(counter)

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

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

print(cnt)

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

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

Solution (Python):
N, K = map(int, input().split())
h = sorted([int(i) for i in input().split()], reverse = True)
count = 0
for j in h:
  if j >= K:
    count += 1
  elif j <= K:
    break
print(count)

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

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

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

h.sort()

ans = 0
for i in range(n):
    if h[i] >= k:
        ans = n - i 
        break

print(ans)

Solution (Python):
N, K = [int(i) for i in input().split()]
heights = [int(i) for i in input().split()]
ret = len(list(filter(lambda x: x >= K, heights)))
print(ret)

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

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

Solution (Python):

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

Solution (Python):
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

n, k = map(int, input().split())
L = np.array(inpl())
print(len(L[L>=k]))

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 = 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()))
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 h:
    if i >= k:
        ans += 1

print(ans)

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

c = 0
for i in lis:
        if i >= k:
            c += 1
print(c)

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

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

if k > h[n-1]:
    print(0)

else:

    low = 0
    high = n-1
       
    while low < high:
           
        mid = (low + high)//2
           
        if k > h[mid]:
               
            low = mid +1
           
        else:    
               
            high = mid 

    else:
           
        print(n - low)

Solution (Python):
from bisect import bisect_left

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

print(n - bisect_left(h,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

print(count)

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

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

can_ride = []

for i in range(N):
    if h[i] >= K:
        can_ride.append(h[i])
        
print(len(can_ride))

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())
    h = list(map(int,input().split()))
    print(len(list(filter(lambda x: x>=k, h))))

if __name__ == "__main__":
    main()

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

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

print(count)

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

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

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

Solution (Python):


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

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

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

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

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

print(count)

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

n = nk[0]
k = nk[1]

a = []
for i in range(n):
	if h[i] >= k:
		a.append(h[i])

print(len(a))

Solution (Python):
N, K=map(int, input().split())
S=list(map(int, input().split()))
ans=0
for i in range(N):
  if S[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())
d=list(map(int,input().split()))
list_A=[]
d.sort()
for num in d:
    if K<=num:
        list_A.append(num)
print(len(list_A))

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

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 = count+1
print(count)

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