#include <bits/stdc++.h>
using namespace std;
const int MAX = 100100;
int n, k;
int a[MAX];
map<int, int> dic;
set<int> S;
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 0; i < int(n); i++) {
    scanf("%d", a + i);
    if (i < k) dic[a[i]]++;
  }
  for (__typeof((dic).begin()) v = (dic).begin(); v != (dic).end(); v++)
    if (v->second == 1) S.insert(v->first);
  for (int i = 0; i <= n - k; i++) {
    if (S.empty())
      printf("Nothing\n");
    else
      printf("%d\n", *S.rbegin());
    if (a[i] != a[i + k]) {
      int x = dic[a[i]]--;
      int y = dic[a[i + k]]++;
      if (x == 1)
        S.erase(a[i]);
      else if (x == 2)
        S.insert(a[i]);
      if (y == 1)
        S.erase(a[i + k]);
      else if (y == 0)
        S.insert(a[i + k]);
    }
  }
}
