Longest Streak of Working Hours

You are given an integer \(N\) representing the number of days and an integer \(T\) representing a threshold of working hours. Additionally, you are provided a list of \(N\) integers where each integer denotes the number of hours worked on that day.

Your task is to determine the length of the longest continuous sequence (streak) of days during which the working hours were strictly greater than \(T\) each day.

Note: A day is only counted if its working hours \(h\) satisfy \(h > T\). If no day meets this condition, the answer should be 0.

inputFormat

The input is read from standard input (stdin) and consists of two lines:

• The first line contains two space-separated integers \(N\) and \(T\), where \(N\) is the number of days and \(T\) is the threshold of working hours.
• The second line contains \(N\) space-separated integers representing the hours worked on each day.

outputFormat

Output a single integer to standard output (stdout): the length of the longest streak of consecutive days where the working hours were strictly greater than \(T\).

10 5
6 3 8 4 5 7 9 10 2 3

3