#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  set<int> once;
  map<int, int> cnt;
  int f = 0;
  int s = k - 1;
  for (int i = 0; i <= s; i++) cnt[v[i]]++;
  for (auto it = cnt.begin(); it != cnt.end(); it++)
    if (it->second == 1) once.insert(it->first);
  if (once.empty())
    cout << "Nothing\n";
  else
    cout << *once.rbegin() << '\n';
  while ((++f) && (++s < n)) {
    int new_val = v[s];
    int last_val = v[f - 1];
    cnt[last_val]--;
    cnt[new_val]++;
    if (cnt[last_val] == 1)
      once.insert(last_val);
    else
      once.erase(last_val);
    if (cnt[new_val] == 1)
      once.insert(new_val);
    else
      once.erase(new_val);
    if (once.empty())
      cout << "Nothing\n";
    else
      cout << *once.rbegin() << '\n';
  }
}
int32_t main() {
  int n = 1;
  while (n--) solve();
}
