Griffy is flying to Don Mills C.I. to make friends (after Glenforest's defeat in ECOO)! Griffy would like to fly at exactly ~N~ meters off the ground (the most relaxing height). However, Don Mills (being a weird school) recently installed ~M~ giant cat girl plushies in a line (right on Griffy's course too!). Each plushie ~i~ has a height of ~H_i~, 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.
The first line will contain a single integer ~N~ ~(1 \le N \le 200)~.
The second line will contain a single integer ~M~ ~(1 \le M \le 200)~.
The next ~M~ lines will contain values of ~H_i~ ~(1 \le H_i \le 400)~.
Output one line, the number of plushies that Griffy will fly into.
5 3 1 7 5