## GFSSOC '14 Winter J1 - Flying Plushies

View as PDF

Points: 3 (partial)
Time limit: 2.0s
Memory limit: 16M

Authors:
Problem type

Griffy is flying to Don Mills C.I. to make friends (after Glenforest's defeat in ECOO)! Griffy would like to fly at exactly meters off the ground (the most relaxing height). However, Don Mills (being a weird school) recently installed giant cat girl plushies in a line (right on Griffy's course too!). Each plushie has a height of , and spans from the ground to its height inclusive. Determine how many plushies Griffy will fly into, assuming he will fly in a straight line at a constant height.

#### Input Specification

The first line will contain a single integer .

The second line will contain a single integer .

The next lines will contain values of .

#### Output Specification

Output one line, the number of plushies that Griffy will fly into.

#### Sample Input

5
3
1
7
5

#### Sample Output

2