#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e5 + 10;
const long long oo = (long long)2e9, maxv = 1e9;
int N, K, A[maxN], B[maxN], mark[maxN];
long long IT[maxN * 4];
void update(const int key, const int l, const int r, const int i,
            const long long v) {
  if (i < l || i > r) return;
  if (l == r) {
    IT[key] = v;
    return;
  }
  const int mid = (l + r) / 2;
  update(key * 2, l, mid, i, v);
  update(key * 2 + 1, mid + 1, r, i, v);
  IT[key] = max(IT[key * 2], IT[key * 2 + 1]);
}
int main() {
  cin >> N >> K;
  for (int i = 0; i < N; i++) cin >> A[i];
  for (int i = 0; i < N; i++) B[i] = A[i];
  sort(B, B + N);
  fill_n(IT + 1, N * 4, -oo);
  for (int i = 0; i < N; i++) {
    int j = lower_bound(B, B + N, A[i]) - B;
    mark[j]++;
    if (mark[j] == 1)
      update(1, 0, N - 1, j, B[j]);
    else
      update(1, 0, N - 1, j, -oo);
    if (i - K >= 0) {
      j = lower_bound(B, B + N, A[i - K]) - B;
      mark[j]--;
      if (mark[j] == 1)
        update(1, 0, N - 1, j, B[j]);
      else
        update(1, 0, N - 1, j, -oo);
    }
    const long long ans = IT[1];
    if (i >= K - 1)
      if (ans == -oo)
        puts("Nothing");
      else
        cout << ans << endl;
  }
}
