Longest passing streak

Problem

A student writes a daily practice test for n days. A day counts as passed when that day's mark is at least p.

Find the length of the longest run of consecutive passed days. If no day was passed, print 0.

Input: The first line has two integers n and p. The second line has n integers: the marks for each day, in order.
Output: One integer: the length of the longest passing streak.
Constraints: 1 ≤ n ≤ 10^5
0 ≤ p ≤ 100
0 ≤ mark ≤ 100

Example 1

Input

7 40
45 50 30 40 41 42 10

Output

Days 4, 5 and 6 (marks 40, 41, 42) form a streak of 3. A mark of exactly 40 counts.

Example 2

Input

3 90
10 20 30

Output

No day is passed.

Try the problem first. Open one hint at a time.

Hint 1

Keep a current streak length and a best length.

Hint 2

On a passed day, add 1 to current and update best. On a failed day, reset current to 0.

Hint 3

"At least p" means mark >= p, not mark > p.

Hint 4

Update best inside the loop, not only when a streak breaks, or a streak that reaches the last day is lost.

Write your Java code, run it on the examples and submit it to hidden tests.