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 PHP7 (7.0.15) (judge verdict: Wrong Answer)

<?php

$a = trim(fgets(STDIN));
$b = trim(fgets(STDIN));

$c = explode(' ', $a);
$h = explode(' ', $b);

$n = $c[0];
$k = $c[1];

function binary_search($arr, $key, $n)
{
    $left = 0;
    $right = $n;
    $mid = ($left + $right) / 2;

    while ($left < $right && $arr[$mid] !== $key) {
        if ($key > $arr[$mid]) {
            $left = $mid + 1;
        } else {
            $right = $mid - 1;
        }
        $mid = ($left + $right) / 2;
    }
    return $mid;
}

sort($h);
echo $n - binary_search($h, $k, $n);