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

if __name__ == '__main__':
    solve() def solve():
    n, k = map(int, input().split())
    h = map(int, input().split())
    count = 0
    for i in h:
        if i >= k:
            count += 1
    print(count) solve n, k = map(int, input().split()) n map(int, input().split()) map int input().split() ().split () input split k h = map(int, input().split()) h map(int, input().split()) map int input().split() ().split () input split count = 0 count 0 for i in h:
        if i >= k:
            count += 1
     i h if i >= k:
            count += 1
     i >= k i k count += 1 count 1 print(count) print count if __name__ == '__main__':
    solve() __name__ == '__main__' __name__ '__main__' solve() solve def solve():
    n, k = map(int, input().split())
    h = map(int, input().split())
    count = 0
    for i in h:
        if i >= k:
            count += 1
    print(count) def solve():
    n, k = map(int, input().split())
    h = map(int, input().split())
    count = 0
    for i in h:
        if i >= k:
            count += 1
    print(count) solve
def solve():
    n, k = map(int, input().split())
    h = map(int, input().split())
    count = 0
    for i in h:
        if i >= k:
            count += 1
    print(count)

if __name__ == '__main__':
    solve()
