#include <bits/stdc++.h>
using namespace std;
long long n, i, j, k, l, sum = 0, flag = 0, t, a[100005], ans = 0;
unordered_map<long long, long long> dp;
set<long long> s;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (i = 0; i < n; i++) {
    cin >> j;
    a[i] = j;
    dp[j]++;
    if (dp[j] == 2)
      s.erase(s.find(j));
    else if (dp[j] == 1)
      s.insert(j);
    if (i >= k - 1) {
      if (s.size())
        cout << *s.rbegin() << '\n';
      else
        cout << "Nothing\n";
      dp[a[i - k + 1]]--;
      if (dp[a[i - k + 1]] == 0)
        s.erase(s.find(a[i - k + 1]));
      else if (dp[a[i - k + 1]] == 1)
        s.insert(a[i - k + 1]);
    }
  }
  return 0;
}
