#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000 + 7;
const double esp = 1e-13;
const double pi = 3.141592653589;
map<int, int> sl;
int n, k, a[100000 + 10];
priority_queue<int> s;
int main() {
  ({
    int neg = 0;
    n = 0;
    char ch;
    for (ch = getchar(); ch < '0' || ch > '9'; ch = getchar())
      if (ch == '-') neg = 1 - neg;
    n = ch - 48;
    for (ch = getchar(); ch >= '0' && ch <= '9'; ch = getchar())
      n = (n << 3) + (n << 1) + ch - 48;
    if (neg) n = -n;
  });
  ({
    int neg = 0;
    k = 0;
    char ch;
    for (ch = getchar(); ch < '0' || ch > '9'; ch = getchar())
      if (ch == '-') neg = 1 - neg;
    k = ch - 48;
    for (ch = getchar(); ch >= '0' && ch <= '9'; ch = getchar())
      k = (k << 3) + (k << 1) + ch - 48;
    if (neg) k = -k;
  });
  for (int i = (1), _b = (n); i <= _b; i++)
    ({
      int neg = 0;
      a[i] = 0;
      char ch;
      for (ch = getchar(); ch < '0' || ch > '9'; ch = getchar())
        if (ch == '-') neg = 1 - neg;
      a[i] = ch - 48;
      for (ch = getchar(); ch >= '0' && ch <= '9'; ch = getchar())
        a[i] = (a[i] << 3) + (a[i] << 1) + ch - 48;
      if (neg) a[i] = -a[i];
    });
  for (int i = (1), _b = (n); i <= _b; i++) {
    sl[a[i]]++;
    if (i > k) sl[a[i - k]]--;
    if (sl[a[i]] == 1) s.push(a[i]);
    if (i > k)
      if (sl[a[i - k]]) s.push(a[i - k]);
    if (i >= k) {
      while (!s.empty() && sl[s.top()] != 1) s.pop();
      if (s.empty())
        cout << "Nothing"
             << "\n";
      else
        cout << s.top() << "\n";
    }
  }
}
