Longest streak above target

Problem

A sales team logs the revenue for n days. A streak is a run of days in a row where each day is strictly above a target t. Print the length of the longest streak, or 0 if there is none.

Input, output and limits

Input: Line 1: two integers n and t. Line 2: n integers.
Output: One integer.
Constraints: 1 ≤ n ≤ 1000
0 ≤ revenue, t ≤ 1000

Examples

Example

Input

8 5
7 8 3 9 9 9 2 6

Output

The days 9 9 9 are three days above 5 in a row.

Hints

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

Hint 1

Keep a counter of the current streak and reset it to 0 on a day that is not above t.

Hint 2

Keep the largest counter seen.

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

Solve in the editor

Stretches with no repeatseasy
Longest text without a repeatmedium
Quietest stretcheasy
Shortest run to reach a targetmedium
Most vowels in a roweasy

All Python problems

Problem

Input, output and limits

Examples

Hints

More Sliding Window problems

Problem

Input, output and limits

Examples

Hints

More Sliding Window problems