019. Boomilever
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

You are working on your Boomilevers for Science Olympiad, an event that requires the breaking of various "boomilevers". For this problem, you are given a list of numbers representing the force you applied to each boomilever in pounds. You know a certain number of pounds that will always break any boomilever. Given these values, calculate how many of your boomilevers have broken so far.

Input

The first line of input contains two space-separated integers n and m representing the number of boomilevers, and the force required to break a boomilever, respectively. The next line contains n space-separated integers representing the force applied to each boomilever.

Output

Output a single positive integer b: the number of boomilevers that have broken so far.

Example
Input
5 30
20 25 30 35 40
Output
3