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