#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 4;
const long long oo = 1e18;
const long long mod = 1e9 + 7;
int n, m;
long long a[N], b[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  map<long long, long long> mp;
  int i = 0;
  long long mx = -1e9;
  for (; i < m; i++) {
    mp[a[i]]++;
    mx = max(a[i], mx);
  }
  for (; i <= n; i++) {
    long long ans = 1e9;
    for (auto it = mp.rbegin(); it != mp.rend(); it++) {
      if (it->second == 1) {
        ans = it->first;
        break;
      }
    }
    if (ans == 1e9) {
      cout << "Nothing" << endl;
    } else {
      cout << ans << endl;
    }
    mp[a[i - m]]--;
    if (mp[a[i - m]] == 0) {
      mp.erase(a[i - m]);
    }
    mp[a[i]]++;
  }
  return 0;
}
