#include <bits/stdc++.h>
using namespace std;
const int MAX = 100005;
int a[MAX];
map<int, int> myMap;
set<int> mySet;
int main() {
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    myMap[a[i]] = 0;
  }
  for (int i = 1; i < k; i++) {
    myMap[a[i]]++;
    if (myMap[a[i]] == 1) mySet.insert(a[i]);
    if (myMap[a[i]] == 2) {
      mySet.erase(a[i]);
    }
  }
  for (int i = k; i <= n; i++) {
    myMap[a[i]]++;
    if (myMap[a[i]] == 1) mySet.insert(a[i]);
    if (myMap[a[i]] == 2) {
      mySet.erase(a[i]);
    }
    if (mySet.size() == 0)
      cout << "Nothing" << endl;
    else
      cout << *mySet.rbegin() << endl;
    myMap[a[i - k + 1]]--;
    if (myMap[a[i - k + 1]] == 1) mySet.insert(a[i - k + 1]);
    if (myMap[a[i - k + 1]] == 0) mySet.erase(a[i - k + 1]);
  }
}
