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 JavaScript (node.js v5.12) (judge verdict: Accepted)

"use strict";

function main(input) {
  let pass_friend_num = parseInt(input.split("\n")[0].split(" ")[0]);
  const pass_height = parseInt(input.split("\n")[0].split(" ")[1]);

  const friend_height_data = input.split("\n")[1].split(" ");

  for (let i = 0; i < friend_height_data.length; i++) {
    if (pass_height > parseInt(friend_height_data[i])) {
      pass_friend_num--;
    }
  }

  console.log(pass_friend_num);
}

main(require("fs").readFileSync("/dev/stdin", "UTF-8"));