#include <bits/stdc++.h>
using namespace std;
const int L = 1e5 + 5;
int n, k;
long long a[L];
set<long long> s;
map<long long, int> m;
int main() {
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    scanf("%lld", &a[i]);
  }
  for (int i = 0; i < k; ++i) {
    m[a[i]]++;
  }
  for (int i = 0; i < k; ++i) {
    if (m[a[i]] == 1) {
      s.insert(a[i]);
    }
  }
  if (s.empty()) {
    cout << "Nothing" << endl;
  } else {
    cout << *s.rbegin() << endl;
  }
  for (int i = k; i < n; ++i) {
    if (--m[a[i - k]] == 0) {
      s.erase(a[i - k]);
    } else if (m[a[i - k]] == 1) {
      s.insert(a[i - k]);
    }
    if (++m[a[i]] == 1) {
      s.insert(a[i]);
    } else if (m[a[i]] > 1) {
      s.erase(a[i]);
    }
    if (s.empty()) {
      cout << "Nothing" << endl;
    } else {
      cout << *s.rbegin() << endl;
    }
  }
  return 0;
}
