#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())

const int INF = 2e9 + 1;
int mx[1000005][20], mn[1000005][20];
int dp[1000005], boss[1000005];

int range(int l, int r) {
    //cerr << "range " << l << " " << r << "\n";
    assert(l <= r);
    int lg = __lg(r - l + 1);
    int mx_val = max(mx[r][lg], mx[l + (1 << lg) - 1][lg]);
    int mn_val = min(mn[r][lg], mn[l + (1 << lg) - 1][lg]);
    return mx_val - mn_val;
}

int finds(int x) {
    if (x == boss[x]) return x;
    return boss[x] = finds(boss[x]);
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, k, c0 = 0;
    cin >> n >> k;
    int L = __lg(n);
    vector<int> stk;
    fill_n(mx[0], L, -1);
    fill_n(mn[0], L, INF);
    iota(boss, boss + n + 1, 0);
    for (int i = 1; i <= n; ++i) {
        int x;
        cin >> x, x ^= c0;
        mx[i][0] = mn[i][0] = x;
        for (int j = 1; j <= L && i >= (1 << j); ++j) {
            mx[i][j] = max(mx[i][j - 1], mx[i - (1 << (j - 1))][j - 1]);
            mn[i][j] = min(mn[i][j - 1], mn[i - (1 << (j - 1))][j - 1]);
            //cerr << "mx " << i << " " << j << " = " << mx[i][j] << "\n";
            //cerr << "mn " << i << " " << j << " = " << mn[i][j] << "\n";
        }

        auto check1 = [&](int mid) {
            int lb = finds(mid);
            return (lb == 0 || lb >= k) && dp[lb] <= range(mid + 1, i);
        };

        auto check2 = [&](int mid) {
            return range(stk[mid] + 1, i) <= dp[stk[mid]];  
        };

        if (i >= k) {
            if (i - k >= k || i == k) {
                while (!stk.empty() && dp[stk.back()] >= dp[i - k]) {
                    boss[finds(stk.back())] = i - k;
                    stk.pop_back();
                }
                stk.pb(i - k);
            }
            {
                int l = 0, r = i - k;
                while (l < r) {
                    int mid = (l + r + 1) >> 1;
                    if (check1(mid)) l = mid;
                    else r = mid - 1;
                }
                dp[i] = range(l + 1, i);
            }
            {
                int l = 0, r = SZ(stk) - 1;
                while (l < r) {
                    int mid = (l + r) >> 1;
                    if (check2(mid)) r = mid;
                    else l = mid + 1;
                }
                dp[i] = max(dp[i], dp[stk[l]]);
            }
        }
        cout << (c0 = dp[i]) << "\n";
    }
}