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

int n;
vector<long long> a;   // day can sap xep, dung chung cho cac sub

// Kiem tra mot cach sap xep vong c: moi phan tu nho hon tong hai lang gieng.
bool valid(const vector<long long>& c) {
    int k = c.size();
    for (int i = 0; i < k; i++)
        if (!(c[i] < c[(i + k - 1) % k] + c[(i + 1) % k])) return false;
    return true;
}

// Cach xep "chuan": sap xep tang dan roi doi cho hai phan tu lon nhat cuoi day.
vector<long long> canon() {
    vector<long long> b = a;
    sort(b.begin(), b.end());
    swap(b[n - 1], b[n - 2]);
    return b;
}

void print(const vector<long long>& c) {
    cout << "YES\n";
    for (int i = 0; i < n; i++) cout << c[i] << (i + 1 == n ? "\n" : " ");
}

// Sub 1: vet can, thu moi hoan vi de biet co cach xep hop le hay khong. Dung khi n <= 8.
// Neu co, in cach xep chuan (sap tang dan, doi cho hai so lon nhat); neu cach do khong hop le
// (khong xay ra voi so duong) thi in hoan vi hop le dau tien tim duoc.
void sub1() {
    vector<long long> p = a, first;
    sort(p.begin(), p.end());
    bool found = false;
    do {
        if (valid(p)) { found = true; first = p; break; }
    } while (next_permutation(p.begin(), p.end()));
    if (!found) { cout << "NO\n"; return; }
    vector<long long> c = canon();
    print(valid(c) ? c : first);
}

// Sub 2: cach xep chuan, kiem tra hop le bang O(n). Dung cho moi n.
// Sap tang dan: moi so (tru so lon nhat) deu nho hon tong hai lang gieng vi lang gieng ben phai >= no
// va lang gieng ben trai duong. Chi can lo cho so lon nhat va hai so lon nhat -> doi cho hai so cuoi.
void sub2() {
    vector<long long> c = canon();
    if (valid(c)) print(c);
    else cout << "NO\n";
}

int main() {
    int q;
    cin >> q;
    while (q--) {
        cin >> n;
        a.assign(n, 0);
        for (int i = 0; i < n; i++) cin >> a[i];
        // Moi truy van chon sub theo n
        if (n <= 8) sub1();
        else sub2();
    }
    return 0;
}