#include <bits/stdc++.h>
using namespace std;
int c[1<<16];
int n , x,y,z;
int numxor[1<<16];
int numor[1<<16];
int ans[1<<16];
vector<int> A,O,X;
void gen()
{
    A.clear();O.clear();X.clear();
    for(int i = 0;i <= n - 1;i++) {
       // printf("%d , %d %d\n",i,numxor[i],numor[i]);
        for(int j = 1;j <= numxor[i];j++) X.push_back(i);
        for(int j = 1;j <= numor[i];j++) O.push_back(i);
        for(int j = 1;j <= c[i]-numxor[i]-numor[i];j++) A.push_back(i);
    }

    for(int i = n - 1;i >= 0;i--) {
        if(numor[i]) printf("1");
        else if(numxor[i] & 1) printf("1");
        else printf("0");
    }
    printf("\n");
    for(int i = 1;i <= A.size();i++) printf("&");
    for(int i = 1;i <= X.size();i++) printf("^");
    for(int i = 1;i <= O.size();i++) printf("|");
    printf("\n");
    for(int i = 0;i < A.size();i++) printf("%d ",A[i]);
    for(auto u : X) printf("%d ",u);
    for(auto u : O) printf("%d ",u);
    printf("\n");return;
}
struct state
{
    int op; ///1 and , 2 xor , 3or
    int v;
};
vector<state> v[1<<16];
state q[1<<16];
void gen2()
{
  //  puts("HERE");
    for(int i = 0;i <= n - 1;i++) {
        for(int j = 0;j < v[i].size();j++) q[v[i][j].v].op = v[i][j].op , q[v[i][j].v].v = i;
    }
    int cnt = 0 , cls = 0;
    for(int i = 0;i <= n - 1;i++) ans[i] = -1;
    for(int i = 1;i <= n;i++) {
        if(q[i].op == 1){
            if(ans[q[i].v] < cls) ans[q[i].v] = -1;
            else ans[q[i].v] = i;
            cls = i;
        }
        else if(q[i].op == 2) {
            if(ans[q[i].v] < cls) ans[q[i].v] = i;
            else ans[q[i].v] = -1;
        }
        else {
            ans[q[i].v] = i;
        }
      //  printf("i %d , %d %d\n",i,ans[i],cls);
    }
    for(int i = n - 1;i >= 0;i--) {
        if(ans[i] < cls) printf("0");
        else printf("1");
    }
    printf("\n");
    for(int i = 1;i <= n;i++) {
        if(q[i].op == 1) printf("&");
        else if(q[i].op == 2) printf("^");
        else printf("|");
    }
    printf("\n");
    for(int i = 1;i <= n;i++) printf("%d ",q[i].v);
    printf("\n");return;
}
int num[1<<16] , sum[1<<16];
void solve()
{
    scanf("%d%d%d%d",&n,&x,&y,&z);swap(y,z);
    for(int i = 0;i < n;i++) c[i] = 0 ,  numxor[i] = numor[i] = 0 , v[i].clear() , num[i] = sum[i] = 0;
    for(int i = 1;i <= n;i++){
        int u;scanf("%d",&u);c[u]++;
    }

    int num = 0;
    for(int i = 0;i <= n - 1;i++) num += (c[i] > 0);
    if(num >= y + z) {
        for(int i = n - 1;i >= 0 && (y || z);i--) {
            if(!c[i]) continue;
            if(y) {numxor[i]++;y--;}
            else {numor[i]++;z--;}
        }
        gen();return;
    }

    if(x >= 2) {
        int cnt = n , num1 = 2 , pos;
        int lstor = 0;
        for(int i = 0;i <= n - 1 && (y||z);i++) {
            if(!c[i]) continue;
            if(y) {v[i].push_back((state){2,cnt--}); y--;}
            else {v[i].push_back((state){3,cnt--});z--;lstor = i;}
        }
        for(int i = 0;i <= n - 1 && num1;i++) {
            if(!c[i]) continue;
            if(v[i].size() < c[i]) v[i].push_back((state){1 , cnt--}) , x-- , num1-- , pos = i;
        }
        if(num1 && (z || lstor) && v[pos][0].op == 2) {
            if(z) {v[pos][0].op = 3;z--;y++;}
            else {
                swap(v[pos][0].op , v[lstor][0].op);
            }
            pos = 0;
        }
        if(!num1) pos = 0;
        for(int i = 0;i <= n - 1 && num1;i++) {
            if(!c[i]) continue;
            if(v[i].size() < c[i]) v[i].push_back((state){1 , cnt--}) , x-- , num1--;
        }


        for(int i = 0;i <= n - 1;i++) {
            while(v[i].size() < c[i]) {
                if(x) v[i].push_back((state){1 , cnt--}) , x--;
                else if(y) v[i].push_back((state){2 , cnt--}) , y--;
                else v[i].push_back((state){3 , cnt--}) , z--;
            }
        }
        if(pos) {
            if(v[pos][0].op != 3) {
                int cc = 0 , ftp;
                for(int j = 0;j < v[pos].size();j++) {
                    cc += (v[pos][j].op == 2);
                    if(v[pos][j].op == 1) ftp = j;
                }
                if(cc % 2 == 0) {
                  //  puts("IN");
                    for(int j = 0;j < pos;j++) {
                      //  printf("j %d , %d\n",j,v[j].size());
                        if(v[j].size()) {
                            swap(v[j][0].op , v[pos][ftp].op);
                            int lm = v[j][0].v;
                            for(int w = 0;w <= n - 1;w++) {
                                for(auto &kk : v[w]) {
                                    if(kk.v < lm) kk.v++;
                                }
                            }
                            v[j][0].v = 1;
                            break;
                        }
                    }
                }
            }
        }
        gen2();return;
    }


    int ttl = 0;
    for(int i = 0;i < n;i++) {
        if(c[i]) {ttl += (c[i] - (c[i] % 2 == 0));}
    }

    if(ttl >= y) {/*
        num[0] = (c[0] > 0) , sum[0] = c[0];
        for(int i = 1;i <= n - 1;i++) num[i] = num[i - 1] + (c[i] > 0) , sum[i] = sum[i - 1] + c[i];
        for(int i = n - 1;i >= 0;i--) {
            if(!c[i]) continue;
            int d;
            if((c[i] - numxor[i]) & 1) d = c[i] - numxor[i] - 1;
            else d = c[i] - numxor[i] ;
            for(int j = d;j >= 1;j -= 2) {
                if()
            }
        }*/

       // puts("IN");
        for(int i = n - 1;i >= 0 && y;i--) {
            if(c[i]) {numxor[i]++ ; y--;}
        }

        for(int i = n - 1;i >= 0 && y > 1;i--) {
            if((c[i] - numxor[i])) {
                int d;
                if((c[i] - numxor[i]) & 1) d = c[i] - numxor[i] - 1;
                else d = c[i] - numxor[i] ;
                numxor[i] += min(d , y - 1);y -= min(d , y - 1);

                if(y == 1 && (numxor[i] % 2 == 0) && numxor[i] < c[i]) {
                    numxor[i]++ ; y--;
                }
            }
        }
        if(z){
        for(int i = 0;i <= n - 1 && y;i++) {
            if(c[i] - numxor[i] > 1) {
                y--;numxor[i]++;
            }
        }
        }
        for(int i = 0;i <= n - 1 && y;i++) {
            if(c[i] - numxor[i] > 0) {
                y-- ; numxor[i]++;

                if(numxor[i] < c[i]) {
                    for(int j = 0;j < i;j++) {
                        if(numxor[j]) {numxor[j]--;numxor[i]++;break;}
                    }
                }
            }
        }
        for(int i = n - 1;i >= 0 && z;i--) {
            if(numxor[i] < c[i] && numxor[i] % 2 == 0) {
                numor[i]++ ; z--;
            }
        }
        for(int i = n - 1;i >= 0 && z;i--) {
            if(numxor[i] + numor[i] < c[i]) {
                int d = min(c[i] - numxor[i] - numor[i] , z);
                z -= d ; numor[i] += d;
            }
        }
        gen();return;
    }

    if(x == 1) {
        //puts("HERE");
        int cnt = n;
        for(int i = 0;i <= n - 1;i++) {
            if(!c[i]) continue;
            if(c[i] & 1) {
                y -= c[i] ;
                for(int j = 1;j <= c[i];j++) v[i].push_back((state){2 , cnt--});
            }
            else {
                y -= (c[i] - 1);
                for(int j = 1;j <= c[i] - 1;j++) v[i].push_back((state){2 , cnt--});
            }
        }
      //  printf("cnt %d\n",cnt);
        for(int i = 0;i <= n - 1;i++) {
            if(v[i].size() < c[i]) {
                if(z) v[i].push_back((state){3,cnt--}) , z-- , swap(v[i][v[i].size()-1].v , v[i][0].v);
                else if(x) v[i].push_back((state){1 , cnt--}) , x--;
                else v[i].push_back((state){2 , cnt--}) , y--;
            }
           // printf("i %d %d %d\n",i,v[i].size(),c[i]);
        }
        //printf("cnt %d\n",cnt);
        gen2();return;
    }
    for(int i = 0;i <= n - 1;i++) {
        if(!c[i]) continue;
        if(c[i] & 1) {
            y -= c[i] ; numxor[i] = c[i];
        }
        else {
            y -= (c[i] - 1);numxor[i] = c[i] - 1;
        }
    }

    for(int i = 0;i <= n - 1 && y;i++) {
        if(numxor[i] < c[i]) {
            numxor[i]++ ; y--;
        }
    }

    for(int i = 0;i <= n - 1 && z ;i++) {
        if(numxor[i] < c[i]) {
            numor[i]++ ; x--;
        }
    }

    gen();
    return;
}
int main() {
   // freopen("in.txt","r",stdin);
    int t;scanf("%d",&t);/*
    if(t == 336) {
        int n,x,y,z;
        for(int i = 1;i <= 33;i++) {
            scanf("%d%d%d%d",&n,&x,&y,&z);
            for(int j = 1;j <= n;j++) scanf("%d",&c[j]);
        }
        printf("%d %d %d %d\n",n,x,y,z);
        for(int j = 1;j <= n;j++) printf("%d ",c[j]);return 0;
    }*/
    while(t--) solve();
    return 0;
}