#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 1e5 + 5 , MOD =  1e9 + 7;


int32_t main() {

    cin.tie(0);cin.sync_with_stdio(0);
    cout.tie(0);cout.sync_with_stdio(0);

   int n , k ;
   cin >> n >> k;

   ll a[n] ;

   ll  pr =  0 ;

   multiset<ll> st ;

   for(int i= 0 ; i < k -1 ;i++)
   {
       cin >> a[i] ;
       a[i] ^= pr ;
       cout << 0 << "\n" ;
       pr = 0 ;

       st.insert(a[i]) ;
   }

   ll dp[n] , best[n];

   for(int i = k-1 ; i < n; i++)
   {
       cin >> a[i] ;
       a[i] ^= pr ;


       st.insert(a[i]);

       if(i == k-1)
       {

           cout << *st.rbegin() - *st.begin() << "\n" ;

           dp[i] = *st.rbegin() - *st.begin() ;

           pr = dp[i] ;

           best[i] = -1 ;
       }
       else
       {
           best[i] = best[i-1] ;

           ll mn =*st.begin() , mx = *st.rbegin() ;

           best[i] = i-k ;

           dp[i] = max ( mx - mn , dp[ i-k ] );

           for(int j = i-k+1 ; j > best[i-1] ; j--)
           {
               mn = min( mn , a[j] ) ;
               mx = max( mx , a[j] ) ;

               if( max( mx - mn , dp[j-1] ) < dp[i] )
               {
                   dp[i] = max( mx - mn , dp[j-1] ) ;
                   best[i] = j-1;
               }
           }

           cout << dp[i] << "\n" ;

           pr = dp[i] ;
       }

       st.erase( st.find( a[i-k+1] ) ) ;
   }


    return 0;
}