#include <bits/stdc++.h>
using namespace std;
long long Set(long long N, long long pos) { return N = N | (1 << pos); }
long long reset(long long N, long long pos) { return N = N & ~(1 << pos); }
bool check(long long N, long long pos) { return (bool)(N & (1 << pos)); }
void CI(int &_x) { scanf("%d", &_x); }
void CO(long long &_x) { cout << _x; }
template <typename T>
void getarray(T a[], long long n) {
  for (long long i = 0; i < n; i++) cin >> a[i];
}
template <typename T>
void prLLIarray(T a[], long long n) {
  for (long long i = 0; i < n - 1; i++) cout << a[i] << " ";
  cout << a[n - 1] << endl;
}
const double EPS = 1e-9;
const long long INF = 0x7f7f7f7f;
long long dr8[8] = {1, -1, 0, 0, 1, -1, -1, 1};
long long dc8[8] = {0, 0, -1, 1, 1, 1, -1, -1};
long long dr4[4] = {0, 0, 1, -1};
long long dc4[4] = {-1, 1, 0, 0};
long long kn8r[8] = {1, 2, 2, 1, -1, -2, -2, -1};
long long kn8c[8] = {2, 1, -1, -2, -2, -1, 1, 2};
int ar[100005], kount[100005];
map<int, int> encode;
int decode[100005];
int main() {
  int n, k;
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> ar[i];
    encode[ar[i]] = 1;
  }
  map<int, int>::iterator it;
  int inx = 1;
  for (it = encode.begin(); it != encode.end(); it++) {
    encode[it->first] = inx;
    decode[inx] = it->first;
    inx++;
  }
  for (long long i = 1; i <= n; i++) ar[i] = encode[ar[i]];
  deque<int> DQ;
  set<int> S;
  set<int>::iterator ii;
  for (int i = 1; i <= n; i++) {
    DQ.push_back(ar[i]);
    kount[ar[i]]++;
    if (kount[ar[i]] == 1)
      S.insert(ar[i]);
    else
      S.erase(ar[i]);
    while (DQ.size() > k) {
      int top = DQ.front();
      DQ.pop_front();
      kount[top]--;
      if (kount[top] == 1)
        S.insert(top);
      else
        S.erase(top);
    }
    if (DQ.size() == k) {
      if (S.size() == 0) {
        cout << "Nothing\n";
      } else {
        ii = S.end();
        ii--;
        cout << decode[*ii] << "\n";
      }
    }
  }
}
