# -*- coding: utf-8 -*-
# B

import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline

# 再起回数上限変更
# sys.setrecursionlimit(1000000)

N, k = map(int, input().split())
h = list(map(int, input().split()))
# print(h)
h.sort()
a = bisect.bisect_left(h, k)
print(N-a) import sys sys from collections import defaultdict, deque from heapq import heappush, heappop import math math import bisect bisect input = sys.stdin.readline input sys.stdin.readline sys.stdin sys stdin readline N, k = map(int, input().split()) N map(int, input().split()) map int input().split() ().split () input split k h = list(map(int, input().split())) h list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split h.sort() h.sort h sort a = bisect.bisect_left(h, k) a bisect.bisect_left(h, k) bisect.bisect_left bisect bisect_left h k print(N-a) print N-a N a h = list(map(int, input().split())) list(map(int, input().split())) h N, k = map(int, input().split()) map(int, input().split()) N k = map(int, input().split()) map(int, input().split()) k a = bisect.bisect_left(h, k) bisect.bisect_left(h, k) a input = sys.stdin.readline sys.stdin.readline input
# -*- coding: utf-8 -*-
# B

import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline

# 再起回数上限変更
# sys.setrecursionlimit(1000000)

N, k = map(int, input().split())
h = list(map(int, input().split()))
# print(h)
h.sort()
a = bisect.bisect_left(h, k)
print(N-a)
