#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  int m = n - k + 1;
  int data[n];
  for (int i = 0; i < n; ++i) {
    cin >> data[i];
  }
  set<int> S;
  map<int, int> mp;
  for (int i = 0; i < k - 1; ++i) {
    mp[data[i]]++;
    if (mp[data[i]] == 1)
      S.insert(data[i]);
    else
      S.erase(data[i]);
  }
  for (int i = k - 1; i < n; ++i) {
    mp[data[i]]++;
    if (mp[data[i]] == 1)
      S.insert(data[i]);
    else
      S.erase(data[i]);
    if (S.empty())
      cout << "Nothing" << endl;
    else {
      set<int>::const_iterator it = S.end();
      it--;
      cout << *it << endl;
    }
    mp[data[i - (k - 1)]]--;
    if (mp[data[i - (k - 1)]] == 1)
      S.insert(data[i - (k - 1)]);
    else
      S.erase(data[i - (k - 1)]);
  }
  return 0;
}
