#include <bits/stdc++.h>
using namespace std;
set<int> possible;
map<int, int> frequency;
void p() {
  if (possible.size() > 0) {
    cout << (*(--possible.end())) << endl;
    ;
  } else {
    cout << "Nothing" << endl;
  }
}
int shuzu[100010];
void add(int num) {
  frequency[num]++;
  if (frequency[num] > 1) {
    possible.erase(num);
  } else {
    possible.insert(num);
  }
}
void remove(int num) {
  frequency[num]--;
  if (frequency[num] > 1 || frequency[num] == 0) {
    possible.erase(num);
  } else {
    possible.insert(num);
  }
}
int main() {
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> shuzu[i];
  }
  for (int i = 0; i < k; i++) {
    add(shuzu[i]);
  }
  p();
  for (int i = k; i < n; i++) {
    add(shuzu[i]);
    remove(shuzu[i - k]);
    p();
  }
  return 0;
}
