#include <bits/stdc++.h>
using namespace std;
struct pair_hash {
  template <typename T1, typename T2>
  size_t operator()(const pair<T1, T2> &p) const {
    auto h1 = hash<T1>{}(p.first);
    auto h2 = hash<T2>{}(p.second);
    return h1 ^ h2;
  }
};
const long long INFLL = (long long)1e18 + 100;
const int INFINT = 2 * (int)1e9 + 100;
void die() {
  cout << "-1\n";
  exit(0);
}
const int NMAX = 1e5 + 55;
const int MOD = 1e9 + 7;
const double PI = atan(1) * 4;
const double EPS = 1e-12;
int n, k;
set<int> s;
map<int, int> frecv;
int v[NMAX];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> v[i];
  for (int i = 1; i <= k; i++) {
    frecv[v[i]]++;
    if (frecv[v[i]] == 2) s.erase(v[i]);
    if (frecv[v[i]] == 1) s.insert(v[i]);
  }
  if (s.empty())
    cout << "Nothing\n";
  else
    cout << (*s.rbegin()) << '\n';
  for (int i = k + 1; i <= n; i++) {
    frecv[v[i - k]]--;
    if (frecv[v[i - k]] == 1) s.insert(v[i - k]);
    if (frecv[v[i - k]] == 0) s.erase(v[i - k]);
    frecv[v[i]]++;
    if (frecv[v[i]] == 2 || frecv[v[i]] == 0) s.erase(v[i]);
    if (frecv[v[i]] == 1) s.insert(v[i]);
    if (s.empty())
      cout << "Nothing\n";
    else
      cout << (*s.rbegin()) << '\n';
  }
  return 0;
}
