#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k;
  map<long long, long long> map;
  set<long long> set;
  long long arr[100001];
  cin >> n >> k;
  for (long long i = 0; i < n; i++) {
    cin >> arr[i];
    map[arr[i]]++;
    if (map[arr[i]] == 1) {
      set.insert(arr[i]);
    } else if (map[arr[i]] > 1) {
      set.erase(arr[i]);
    }
    if (i >= k - 1) {
      if (i == k - 1) {
        if (set.size() == 0) {
          cout << "Nothing" << endl;
          ;
        } else {
          cout << *(--(set.end())) << endl;
        }
      } else {
        map[arr[i - k]]--;
        if (map[arr[i - k]] == 0) {
          set.erase(arr[i - k]);
        } else if (map[arr[i - k]] == 1) {
          set.insert(arr[i - k]);
        }
        if (set.size() == 0) {
          cout << "Nothing" << endl;
          ;
        } else {
          cout << *(--(set.end())) << endl;
        }
      }
    }
  }
}
