Counting Target Meeting Days

Given a month with n days, a target running distance t, and a list of distances representing the running distance for each day, determine the number of days where the running distance was at least the target value. In other words, count the days satisfying \(d_i \geq t\) where \(d_i\) denotes the distance run on the ith day.

inputFormat

The input is given in two lines. The first line contains two space-separated integers n and t, where n represents the number of days and t is the target distance.

The second line contains n space-separated integers representing the running distances for each day.

outputFormat

Output a single integer, representing the number of days on which the running distance was at least t.

5 5
3 6 4 7 5

3