#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
const int INF = (((1 << 30) - 1) << 1) + 1;
const int nINF = 1 << 31;
const int N = 1e5 + 10;
int n, k, a[N];
unordered_map<int, int> m;
set<int> s;
signed main() {
  ios::sync_with_stdio(false);
  cin >> n >> k;
  for (int i = 0; i < (n); i++) cin >> a[i];
  for (int i = 0; i < (k); i++) {
    auto& add = m[a[i]];
    add++;
    if (add == 1) s.insert(-a[i]);
    if (add == 2) s.erase(-a[i]);
  }
  if (s.size())
    cout << -*s.begin() << endl;
  else
    cout << "Nothing" << endl;
  for (int i = (k); i <= (n - 1); i++) {
    auto& rem = m[a[i - k]];
    --rem;
    if (rem == 1) s.insert(-a[i - k]);
    if (rem == 0) s.erase(-a[i - k]);
    auto& add = m[a[i]];
    ++add;
    if (add == 1) s.insert(-a[i]);
    if (add == 2) s.erase(-a[i]);
    if (s.size())
      cout << -*s.begin() << endl;
    else
      cout << "Nothing" << endl;
  }
  return 0;
}
