#include <bits/stdc++.h>
using namespace std;
int ar[100005 + 5], ans[100005 + 5];
set<int> st;
map<int, int> MP;
int main() {
  int tc, cs = 1, i, j, k, n, m, x;
  tc = 1;
  while (tc--) {
    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n; i++) scanf("%d", &ar[i]);
    for (int i = 1; i <= k; i++) {
      x = ++MP[ar[i]];
      if (x == 1)
        st.insert(ar[i]);
      else if (x == 2)
        st.erase(ar[i]);
    }
    if ((int)(st.size()) == 0)
      ans[1] = -2000000005;
    else
      ans[1] = (*st.rbegin());
    j = 2;
    for (int i = k + 1; i <= n; i++) {
      x = --MP[ar[i - k]];
      if (x == 1)
        st.insert(ar[i - k]);
      else if (x == 0)
        st.erase(ar[i - k]);
      x = ++MP[ar[i]];
      if (x == 1)
        st.insert(ar[i]);
      else if (x == 2)
        st.erase(ar[i]);
      if ((int)(st.size()) == 0)
        ans[j++] = -2000000005;
      else
        ans[j++] = (*st.rbegin());
    }
    for (int i = 1; i <= n - k + 1; i++) {
      if (ans[i] == -2000000005)
        printf("Nothing\n");
      else
        printf("%d\n", ans[i]);
    }
  }
  return 0;
}
