import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0

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

print(count) import sys sys import math math import itertools itertools import bisect bisect from copy import copy from collections import deque,Counter from decimal import Decimal def s(): return input() s def i(): return int(input()) i def S(): return input().split() S def I(): return map(int,input().split()) I def X(): return list(input()) X def L(): return list(input().split()) L def l(): return list(map(int,input().split())) l def lcm(a,b): return a*b//math.gcd(a,b) lcm a a b b sys.setrecursionlimit(10 ** 9) sys.setrecursionlimit sys setrecursionlimit 10 ** 9 10 9 mod = 10**9+7 mod 10**9+7 10**9 10 9 7 count = 0 count 0 N,K = I() N I() I K h = l() h l() l for i in range(N):
    if h[i] >= K:
        count += 1 i range(N) range N if h[i] >= K:
        count += 1 h[i] >= K h[i] h i K count += 1 count 1 print(count) print count def L(): return list(input().split()) def L(): return list(input().split()) L def s(): return input() def s(): return input() s def lcm(a,b): return a*b//math.gcd(a,b) def lcm(a,b): return a*b//math.gcd(a,b) lcm def i(): return int(input()) def i(): return int(input()) i h = l() l() h mod = 10**9+7 10**9+7 mod count += 1 1 count count = 0 0 count N,K = I() I() N def X(): return list(input()) def X(): return list(input()) X def S(): return input().split() def S(): return input().split() S K = I() I() K def I(): return map(int,input().split()) def I(): return map(int,input().split()) I def l(): return list(map(int,input().split())) def l(): return list(map(int,input().split())) l
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0

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

print(count)
