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 in Rust (1.15.1) (judge verdict: Accepted)

use std::io;
use std::io::Write;

fn main() {
    let mut first_line  = String::new();
    let mut second_line = String::new();

    io::stdin().read_line(&mut first_line)
        .expect("Failed to read first line");

    io::stdin().read_line(&mut second_line)
        .expect("Failed to read second line");

    let first_line: Vec<u32> = first_line
        .split_whitespace()
        .map(|s| s.parse().unwrap())
        .collect();

    let second_line: Vec<u32> = second_line
        .split_whitespace()
        .map(|s| s.parse().unwrap())
        .collect();

    let minimum_height: u32 = first_line[1];
    let mut friends_allowed: u32 = 0;

    for index in 0..second_line.len() {
        if second_line[index] >= minimum_height {
            friends_allowed = friends_allowed + 1;
        }
    }

    print!("{}", friends_allowed);
    io::stdout().flush().unwrap();
}