#include<bits/stdc++.h>
#define ll long long
#define il inline
#define pn putchar('\n')
#define maxint 2147483647
#define min(x,y) (x<y?x:y)
#define max(x,y) (x>y?x:y)
#define maxn 2000005
using namespace std;
int n,m;
int a[maxn],ans[maxn];
il void dfs(int l,int r,int L,int R)
{
    if(l==r)
    {
        ans[l]=a[L];
        return;
    }
    int mid=l+r>>1,midd=L+R>>1;
    dfs(l,mid,midd+1,R),dfs(mid+1,r,L,midd);
    for(int i=l;i<=mid;i++)
        ans[i]^=ans[i+mid-l+1];
}
signed main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    scanf("%d%d",&n,&m);
    for(int i=n-1;~i;i--)
        scanf("%d",&a[i]);
    n=1<<(int)ceil(__lg(n))+1;
    n=1048576;
    dfs(0,n-1,0,n-1);
    for(int i=0;i<m;i++)
        printf("%d ",ans[i%n]);
    return 0;
}