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

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef complex<double> cpx;
template <typename T> using minPq = priority_queue<T, vector<T>, greater<T>>;
#define ms(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define fs first
#define sn second
#define ALL(v) begin(v), end(v)
#define SZ(v) ((int) (v).size())
#define lbv(v, x) (lower_bound(ALL(v), x) - (v).begin())
#define ubv(v, x) (upper_bound(ALL(v), x) - (v).begin())
template <typename T> inline void UNIQUE(vector<T> &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) {cerr << #x << ' ' << x << endl;}
#define dbgArr(arr, n) {cerr << #arr; FR(_i, n) cerr << ' ' << (arr)[_i]; cerr << endl;}
template <typename T, typename U>
ostream& operator<<(ostream &os, pair<T, U> p){return os << "(" << p.fs << ", " << p.sn << ")";}

const int MN = 2e5 + 5;
int n, a, b, c, o;
int arr[MN], brr[MN], crr[MN];

bool solve(){
    cin >> n >> a >> b >> c >> o;
    if(c == n){
        FR(i, n) brr[i] = crr[i] = i;
        if(a != b) return false;
        FR(i, a) arr[i] = n-a+i;
        FOR(i, a, n) arr[i] = n-1-i;
        return true;
    }

    if(a == 1){
        FR(i, n) arr[i] = i;
        FR(i, n) brr[i] = n-1-i;
        if((ll) b*c < n || b+c-1 > n) return false;
        vi vec(c, 1);
        vec[0] = b;
        int rem = n-c-b+1;
        FOR(i, 1, c){
            int d = min(rem, b-vec[i]);
            vec[i] += d;
            rem -= d;
        }

        int cur = n;
        int ri = 0;
        for(int x : vec){
            FR(i, x) crr[ri++] = cur-x+i;
            cur -= x;
        }

        return true;
    }

    return false;
}

int main(){
    cin.sync_with_stdio(0); cin.tie(0);
    int t; cin >> t;
    while(t--){
        bool res = solve();
        if(!res) cout << "NO\n";
        else {
            cout << "YES\n";
            FR(i, n) cout << arr[i]+1 << " \n"[i == n-1];
            FR(i, n) cout << brr[i]+1 << " \n"[i == n-1];
            FR(i, n) cout << crr[i]+1 << " \n"[i == n-1];
        }
    }
}