#include <bits/stdc++.h>
using namespace std;
const int mxn = 1e5 + 100;
int a[mxn], b[mxn], c[mxn];
set<int> mp;
void add(int x) {
  if (c[x] == 0)
    mp.insert(b[x]);
  else if (c[x] == 1)
    mp.erase(b[x]);
  c[x]++;
}
void remove(int x) {
  if (c[x] == 2)
    mp.insert(b[x]);
  else if (c[x] == 1)
    mp.erase(b[x]);
  c[x]--;
}
int main() {
  int n, k, m;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", a + i), b[i - 1] = a[i];
  sort(b, b + n), m = unique(b, b + n) - b;
  for (int i = 1; i <= n; i++) {
    a[i] = lower_bound(b, b + m, a[i]) - b;
    add(a[i]);
    if (i >= k) {
      if (mp.empty())
        puts("Nothing");
      else
        printf("%d\n", *mp.rbegin());
      remove(a[i - k + 1]);
    }
  }
  return 0;
}
