CSES - Aalto Competitive Programming 2024 - wk4 - Mon - Moon landing
  • Time limit: 1.00 s
  • Memory limit: 512 MB

Uolevi is attempting to land a rocket ship on the moon. He can see nn meters directly ahead of him out of the ship's tiny window. The height of moon's surface ii meters ahead the ship is ai mma_i\ \textrm{mm}. Due to budget cuts the ship has no landing gear and cannot tolerate height differences greater than x mmx\ \textrm{mm} under it when landed. Help Uolevi find the longest strip of land ahead of the ship where the height difference of the highest and lowest points is no more than xx. Report it's position and length.

Input

The first line contains two integers nn and xx.

The second line contains nn integers a1,a2,,ana_1,\,a_2,\dots,\,a_n.

Output

Print the position and length of the longest strip on a single line. If there are multiple answers, print any.

Constraints

  • 1n1051 \leq n \leq 10^5
  • 0ai1090 \leq a_i \leq 10^9
  • 0x1090 \leq x \leq 10^9

Example 1

Input:

10 4
10 7 10 0 1 3 10 1 2 1

Output:

8 3

Example 2

Input:

5 10
9 6 1 10 9

Output:

1 5

Example 3

Input:

1 0
0

Output:

1 1