#include<iostream>

 #include<cstdio>

 #include<algorithm>

 using namespace std;

 const int maxn = 1e5+;

 int n, q;

 int a[maxn], prea[maxn], suffa[maxn], preo[maxn], suffo[maxn], prex[maxn], suffx[maxn];

 int main()

 {

     //freopen("in.txt","r",stdin);

     while(~scanf("%d%d",&n,&q))

     {

         scanf("%d",&a[]);

         prea[] = preo[] = prex[] = a[];

         for(int i=;i<=n;i++)

         {

             scanf("%d",&a[i]);

             prea[i] = a[i] & prea[i-];

             preo[i] = a[i] | preo[i-];

             prex[i] = a[i] ^ prex[i-];

         }

         suffa[n] = suffo[n] = suffx[n] = a[n];

         for(int i=n-;i>=;i--)

         {

             suffa[i] = a[i] & suffa[i+];

             suffo[i] = a[i] | suffo[i+];

             suffx[i] = a[i] ^ suffx[i+];

         }

         while(q--)

         {

             int pos; scanf("%d",&pos);

             int ans1 = prea[pos-] & suffa[pos+];

             int ans2 = preo[pos-] | suffo[pos+];

             int ans3 = prex[pos-] ^ suffx[pos+];

             if(pos==)

             {

                 ans1 = suffa[pos+];

                 ans2 = suffo[pos+];

                 ans3 = suffx[pos+];

             }

             if(pos==n)

             {

                 ans1 = prea[pos-];

                 ans2 = preo[pos-];

                 ans3 = prex[pos-];

             }

             printf("%d %d %d\n", ans1, ans2, ans3);

         }

     }

     return ;

 }