401573: GYM100495 E Simple sequence

You are given an array (s) of positive integers having the length n.

Let's define the subarray as the array between some indexes l and r (l ≤ r and elements are s_l, s_l + 1, ..., s_r). We call the subarray "simple" if mn is the minimal element in this subarray, mx is the maximal element in this subarray, a is a given parameter and inequality is satisfied.

You need to find the size of the biggest possible simple subarray.

The first line contains the number of test cases T (1 ≤ T ≤ 50).

In the first line of every test case there are two integers n (1 ≤ n ≤ 10⁵) and a (1 ≤ a ≤ 10⁹) - the size of the array and the described parameter.

In the second line of every test case there are n integers s_i (1 ≤ s_i ≤ 10⁹) - the elements of the array.

For each test case output one line containing “Case #tc: size” where tc is the number of the test case (starting from 1) and size is the size of the biggest possible simple subarray.

2
2 1
1 2
2 1
1 3

Case #1: 2
Case #2: 1