#include <bits/stdc++.h>
using namespace std;
#define int long long 

vector<int> ans[7][7][7][7][3]; 

int lcs(vector<int> p1 , vector<int> p2){
    int n = p1.size(); 
    vector<int> id(n);
    for (int i = 0 ; i < n ; i++) id[p1[i]] = i; 
    for (int i = 0 ; i < n ; i++) p2[i] = id[p2[i]]; 
    vector<int> dp;
    for (int i = 0 ; i < n ; i++){
        int x = lower_bound(dp.begin() , dp.end() , p2[i]) - dp.begin();
        if (x == dp.size()) dp.push_back(p2[i]);
        else dp[x] = p2[i]; 
    }
    return dp.size(); 
}

void proc(){
    for (int n = 1 ; n <= 6 ; n++){
        vector<int> p[3];
        for (int i = 0 ; i < n ; i++) for (int j = 0 ; j < 3 ; j++) p[j].push_back(i);
        do {
            do {
                int a = lcs(p[0] , p[1]) , b = lcs(p[0] , p[2]) , c = lcs(p[1] , p[2]); 
                for (int j = 0 ; j < 3 ; j++) ans[n][a][b][c][j] = p[j]; 
            } while(next_permutation(p[1].begin() , p[1].end()));
        } while(next_permutation(p[2].begin() , p[2].end())); 
    }
}

void doWork(){
    int n , a , b , c , o;
    cin >> n >> a >> b >> c >> o;
    if (n > 6) {cout << "bruh"; return;}
    if (ans[n][a][b][c][0].empty()) {cout << "NO"; return;}
    cout << "YES\n";
    for (int j = 0 ; j < 3 ; j++){
        for (int i = 0 ; i < n ; i++){
            cout << ans[n][a][b][c][j][i] + 1 << ' '; 
        }
        cout << '\n';
    }
}

signed main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    proc(); 
    int t; cin >> t;
    while(t--){
        doWork(); cout << '\n';
    }
}