Subsegments

对于固定长度的每个数列，Sasha必须找到在给定数列上出现的元素的最大值。帮Sasha解决这个问题。 第一行两个整数$n$ 和$k$ $(1\leq n \leq 10^5,1 \leq k \leq n)$,表示数组元素的数目和数列的长度。 然后 $n$ 行，第 $i$ 行包含一个数字$a_i(-10^9 \leq a_i \leq 10^9)$ 输出 $n-k+1$ 个数，每行输出一个数，第$i$行输出以为$i$为起点，长度为$k$的数列中的最大值。 并且在$a_i a_{i+1} .....a_{i+k-1}$,中每个数只能出现一次(重复视为没有元素)，如果数列中没有元素，输出$Nothing$。

Programmer 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.

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} $ ).

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".

5 3
1
2
2
3
3

1
3
2

6 4
3
3
3
4
4
2

4
Nothing
3