Description
Domo is a brilliant dog. When he finds a perfect bed for him, he will fall asleep immediately.
A subarray (a sequence of consecutive elements in an array) is a perfect bed for Domo if it satisfies the following two conditions.
1. the length of this subarray is L.
2. The numbers in the middle are greater than the numbers on both sides the left most and the right most of the subarray. In other words, ai < aj for all pairs of i and j (i ∈ {0, L-1}, 0 < j < L-1)
For example, a subarray [3, 5, 5, 3] is a perfect bed of length 4 for Domo, but [4, 5, 3, 2] isn't (since a[2] < a[0]).
Given an array and an integer L, your task is to find the perfect bed for Domo. If there are multiple perfect beds for Domo, print them all in order by the index of the first element of the subarray.
Check the sample input/output for more details, but be careful not to wake Domo up. He will let you get zero points on this question if he wakes up accidentally.
Input
The first line contains two integers N and L (3 ≤ N ≤ 1000, 3 ≤ L ≤ 10) - the length of the given array and the length of the subarray, respectively.
The second line contains N integers a0, a1, ..., an-1 (0 ≤ ai ≤ 1000)
Output
The subarray of which describes the perfect bed for Domo.
If there are multiple perfect beds, print them all one per line.
If there is no perfect bed for Domo, print "Domo".
Note that you should print a newline character at the end of each line.