#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  int a[100010];
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  map<int, int> mp;
  set<int> st;
  for (int i = 1; i <= k; i++) {
    if (mp[a[i]] >= 1)
      st.erase(a[i]);
    else
      st.insert(a[i]);
    mp[a[i]]++;
  }
  if (st.empty())
    printf("Nothing\n");
  else {
    int x = *(--st.end());
    printf("%d\n", x);
  }
  for (int i = k + 1; i <= n; i++) {
    mp[a[i - k]]--;
    if (mp[a[i - k]] == 1)
      st.insert(a[i - k]);
    else if (mp[a[i - k]] == 0)
      st.erase(a[i - k]);
    mp[a[i]]++;
    if (mp[a[i]] == 1)
      st.insert(a[i]);
    else
      st.erase(a[i]);
    if (st.empty())
      printf("Nothing\n");
    else {
      int x = *(--st.end());
      printf("%d\n", x);
    }
  }
  return 0;
}
