#include <bits/stdc++.h>
using namespace std;
int arr[100005];
map<int, int> m;
set<int> second;
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
  set<int>::iterator it;
  for (int i = 0; i < k; i++) {
    m[arr[i]]++;
    if (m[arr[i]] == 1)
      second.insert(arr[i]);
    else if (m[arr[i]] == 2)
      second.erase(arr[i]);
  }
  if (second.size() == 0)
    printf("Nothing\n");
  else {
    it = second.end();
    it--;
    printf("%d\n", *it);
  }
  for (int i = k; i < n; i++) {
    m[arr[i]]++;
    if (m[arr[i]] == 1)
      second.insert(arr[i]);
    else if (m[arr[i]] == 2)
      second.erase(arr[i]);
    m[arr[i - k]]--;
    if (!m[arr[i - k]])
      second.erase(arr[i - k]);
    else if (m[arr[i - k]] == 1)
      second.insert(arr[i - k]);
    if (second.size() == 0)
      printf("Nothing\n");
    else {
      it = second.end();
      it--;
      printf("%d\n", *it);
    }
  }
  return 0;
}
