#include <bits/stdc++.h>
using namespace std;
int a[100010];
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  map<int, int> aa;
  set<int> bb;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= n; i++) {
    if (aa.find(a[i]) == aa.end())
      aa[a[i]] = 1;
    else
      aa[a[i]]++;
    if (aa[a[i]] > 1)
      bb.erase(-a[i]);
    else
      bb.insert(-a[i]);
    if (i > k) {
      int h = i - k;
      aa[a[h]]--;
      if (aa[a[h]] == 0)
        bb.erase(-a[h]);
      else if (aa[a[h]] == 1)
        bb.insert(-a[h]);
    }
    if (i >= k) {
      if (bb.begin() == bb.end())
        printf("Nothing\n");
      else
        printf("%d\n", -(*bb.begin()));
    }
  }
}
