该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Description

An array of size

≤ 10

is given to you. There is a sliding window of size

which is moving from the very left of the array to the very right. You can only see the

numbers in the window. Each time the sliding window moves rightwards by one position. Following is an example:

, and

is 3.

Your task is to determine the maximum and minimum values in the sliding window at each position.

Input

The input consists of two lines. The first line contains two integers

and

which are the lengths of the array and the sliding window. There are

integers in the second line.

Output

There are two lines in the output. The first line gives the minimum values in the window at each position, from left to right, respectively. The second line gives the maximum values.

8 3
1 3 -1 -3 5 3 6 7

-1 -3 -3 -3 3 3
3 3 5 5 6 7

Source

, Ikki