#include <bits/stdc++.h>

namespace Main {
  const int N = 1e6 + 5;
  int n,k,a[N],f[N];
  struct data_struct_minv {
    int fa[N],stack[N],top;
    int get(int x) { return fa[x] == x ? x : fa[x] = get(fa[x]); }
    void init() {
      for (int i = 1; i <= n; i++)
        fa[i] = i;
    }
    void insert(int x) {
      while (top && a[stack[top]] >= a[x]) {
        fa[stack[top]] = x, -- top;
      }
      stack[++ top] = x;
    }
    int calc(int x) {
      return a[get(x)];
    }
  } minv;
  struct data_struct_maxv {
    int fa[N],stack[N],top;
    int get(int x) { return fa[x] == x ? x : fa[x] = get(fa[x]); }
    void init() {
      for (int i = 1; i <= n; i++)
        fa[i] = i;
    }
    void insert(int x) {
      while (top && a[stack[top]] <= a[x]) {
        fa[stack[top]] = x, -- top;
      }
      stack[++ top] = x;
    }
    int calc(int x) {
      return a[get(x)];
    }
  } maxv;
  int stack[N],top;
  void insert(int x) {
    while (top && f[stack[top]] >= f[x]) {
      -- top;
    }
    stack[++ top] = x;
  }
  void main() {
    scanf("%d%d",&n,&k);
    insert(0);
    minv.init(), maxv.init();
    for (int i = 1; i <= n; i++) {
      scanf("%d",&a[i]);
      a[i] ^= f[i - 1];
      minv.insert(i), maxv.insert(i);
      if (i < k) {
        printf("%d\n",0);
        continue;
      }
      if (i - k >= k)
        insert(i - k);
      if (top == 1) {
        f[i] = maxv.calc(1) - minv.calc(1);
        printf("%d\n",f[i]);
        continue;
      }
      int low = 1, high = top;
      while (low < high) {
        int mid = (low + high + 1) >> 1;
        if (f[stack[mid]] <= maxv.calc(stack[mid] + 1) - minv.calc(stack[mid] + 1))
          low = mid;
        else
          high = mid - 1;
      }
      f[i] = maxv.calc(stack[low] + 1) - minv.calc(stack[low] + 1);
      if (low + 1 <= top)
        f[i] = std::min(f[i],f[stack[low + 1]]);
      printf("%d\n",f[i]);
    }
  }
}

signed main() {
  Main::main();
  return 0;
}