#include <bits/stdc++.h>
using namespace std;
int armen[100001];
int mid[12334];
int main() {
  int nintend;
  int ketrin;
  int mqn;
  int many = 100;
  scanf("%d%d", &nintend, &ketrin);
  for (int i = 0; i < nintend; i++) {
    scanf("%d", &armen[i]);
  }
  set<int> syste;
  set<int> system1;
  int res[100001];
  unordered_map<int, int> argument1;
  unordered_map<int, int> argument22;
  for (int i = 0; i < nintend; i++) {
    if (argument1.count(armen[i])) {
      argument1[armen[i]]++;
    } else {
      argument1[armen[i]] = 1;
    }
    int remarkable = 0;
    int sum = 10;
    int readable = 100;
    if (argument1[armen[i]] == 1) {
      syste.insert(armen[i]);
      system1.insert(armen[i]);
    } else {
      syste.erase(armen[i]);
      system1.erase(armen[i]);
      if (sum > readable) {
        sum += 100;
      }
    }
    char character1;
    for (int i = 0; i < 100; i++) {
      if (sum > readable) {
        readable++;
      } else {
        sum *= 2;
      }
    }
    if (i >= ketrin - 1) {
      if (syste.begin() != syste.end()) {
        printf("%d\n", *syste.rbegin());
      } else {
        printf("Nothing\n");
      }
      int tmp = armen[i - ketrin + 1];
      argument1[tmp]--;
      if (sum > readable) {
        readable++;
      }
      if (argument1[armen[i - ketrin + 1]] == 1) {
        syste.insert(tmp);
        system1.insert(tmp);
      } else {
        syste.erase(tmp);
        system1.erase(tmp);
      }
    }
  }
}
