Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Subsegments

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputProgrammer Sasha has recently begun to study data structures. His coach Stas told him to solve the problem of finding a minimum on the segment of the array in , which Sasha coped with. For Sasha not to think that he had learned all, Stas gave him a new task. For each segment of the fixed length Sasha must find the maximum element of those that occur on the given segment exactly once. Help Sasha solve this problem.

Input

The first line contains two positive integers *n* and *k* (1 ≤ *n* ≤ 10^{5}, 1 ≤ *k* ≤ *n*) — the number of array elements and the length of the segment.

Then follow *n* lines: the *i*-th one contains a single number *a*_{i} ( - 10^{9} ≤ *a*_{i} ≤ 10^{9}).

Output

Print *n*–*k* + 1 numbers, one per line: on the *i*-th line print of the maximum number of those numbers from the subarray *a*_{i} *a*_{i + 1} … *a*_{i + k - 1} that occur in this subarray exactly 1 time. If there are no such numbers in this subarray, print "Nothing".

Examples

Input

5 3

1

2

2

3

3

Output

1

3

2

Input

6 4

3

3

3

4

4

2

Output

4

Nothing

3

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/22/2019 00:59:31 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|