import sys
from collections import defaultdict, deque, Counter
import math

# import copy
from bisect import bisect_left, bisect_right
# import heapq

# sys.setrecursionlimit(1000000)

# input aliases
input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)

def solve():
    n, k = getList()
    nums = getList()
    ans = 0
    for num in nums:
        if num >= k:
            ans += 1

    print(ans)
def main():
    n = getN()
    for _ in range(n):
        solve()


if __name__ == "__main__":
    # main()
    solve() import sys sys from collections import defaultdict, deque, Counter import math math from bisect import bisect_left, bisect_right input = sys.stdin.readline input sys.stdin.readline sys.stdin sys stdin readline getS = lambda: input().strip() getS lambda: input().strip() input().strip() ().strip () input strip getN = lambda: int(input()) getN lambda: int(input()) int(input()) int input() input getList = lambda: list(map(int, input().split())) getList lambda: list(map(int, input().split())) list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split int(x) - 1 for x in input().split() for x in input().split() x input().split() ().split () input split for x in input().split() int(x) - 1 int(x) int x 1 getZList = lambda: [int(x) - 1 for x in input().split()] getZList lambda: [int(x) - 1 for x in input().split()] [int(x) - 1 for x in input().split()] INF = 10 ** 20 INF 10 ** 20 10 20 MOD = 10**9 + 7 MOD 10**9 + 7 10**9 10 9 7 divide = lambda x: pow(x, MOD-2, MOD) divide lambda x: pow(x, MOD-2, MOD) pow(x, MOD-2, MOD) pow x MOD-2 MOD 2 MOD x def solve():
    n, k = getList()
    nums = getList()
    ans = 0
    for num in nums:
        if num >= k:
            ans += 1

    print(ans) solve n, k = getList() n getList() getList k nums = getList() nums getList() getList ans = 0 ans 0 for num in nums:
        if num >= k:
            ans += 1

     num nums if num >= k:
            ans += 1

     num >= k num k ans += 1 ans 1 print(ans) print ans def main():
    n = getN()
    for _ in range(n):
        solve() main n = getN() n getN() getN for _ in range(n):
        solve() _ range(n) range n solve() solve if __name__ == "__main__":
    # main()
    solve() __name__ == "__main__" __name__ "__main__" solve() solve getN = lambda: int(input()) lambda: int(input()) getN getList = lambda: list(map(int, input().split())) lambda: list(map(int, input().split())) getList def main():
    n = getN()
    for _ in range(n):
        solve() def main():
    n = getN()
    for _ in range(n):
        solve() main getS = lambda: input().strip() lambda: input().strip() getS divide = lambda x: pow(x, MOD-2, MOD) lambda x: pow(x, MOD-2, MOD) divide def solve():
    n, k = getList()
    nums = getList()
    ans = 0
    for num in nums:
        if num >= k:
            ans += 1

    print(ans) def solve():
    n, k = getList()
    nums = getList()
    ans = 0
    for num in nums:
        if num >= k:
            ans += 1

    print(ans) solve input = sys.stdin.readline sys.stdin.readline input INF = 10 ** 20 10 ** 20 INF MOD = 10**9 + 7 10**9 + 7 MOD getZList = lambda: [int(x) - 1 for x in input().split()] lambda: [int(x) - 1 for x in input().split()] getZList
import sys
from collections import defaultdict, deque, Counter
import math

# import copy
from bisect import bisect_left, bisect_right
# import heapq

# sys.setrecursionlimit(1000000)

# input aliases
input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)

def solve():
    n, k = getList()
    nums = getList()
    ans = 0
    for num in nums:
        if num >= k:
            ans += 1

    print(ans)
def main():
    n = getN()
    for _ in range(n):
        solve()


if __name__ == "__main__":
    # main()
    solve()