#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define ll long long

using namespace std;

const int N = 1e5 + 10;
string s[N];
int n;

struct node {
    int cnt[26], id;
    node() { memset(cnt, 0, sizeof cnt); }
    bool operator != (const node& W)const {
        for (int j = 0; j < 26; j++)
        {
            if (cnt[j] != W.cnt[j])return 1;
        }
        return 0;
    }
};

vector<node>e[N];

bool cmp(node a, node b)
{
    return a.id < b.id;
}

void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)cin >> s[i], e[i].clear();
    for (int i = n; i > 1; i--)
    {
        int len = s[i - 1].size(), ha[26] = {0};
        for (auto k : s[i - 1])ha[k - 'a']++;
        node t; t.id = s[i].size() - 1;
        for (auto k : s[i])t.cnt[k - 'a']++;
        e[i].push_back(t);
        sort(e[i].begin(), e[i].end(), cmp);
        //然后就是处理附带的限制
        //是不是可以直接暴力去做，每一层只会pushlen个上去
        for (int j = 0, k = 0; j < s[i].size(); j++)
        {
            bool ok = 0;
            while (k < e[i].size() && e[i][k].id == j)
            {
                if (ok) {
                    //cout << i << ' ' << j << endl;
                    if(e[i][k] != e[i][k - 1]){
                        cout << "NO\n";
                        return;
                    }
                }
                else {
                    ok = 1;
                    node t = e[i][k]; t.id = (j + 1) % len - 1;
                    int d = (j + 1) / len;
                    for (int s = 0; s < 26; s++)
                    {
                        t.cnt[s] -= d * ha[s];
                        if (t.cnt[s] < 0) {
                            cout << "NO\n";
                            return;
                        }
                    }
                    if ((j + 1) % len)e[i - 1].push_back(t);
                }
                k++;
            }
        }
    }
    node t; t.id = s[1].size() - 1;
    for (auto k : s[1])t.cnt[k - 'a']++;
    e[1].push_back(t);
    vector<int>ans;
    int ha[26] = { 0 };
    for (int i = 0, j = 0; i < s[1].size(); i++)
    {
        sort(e[1].begin(), e[1].end(), cmp);
        bool ok = 0;
        while (j < e[1].size() && e[1][j].id == i)
        {
            if (ok) {
                if(e[1][j] != e[1][j - 1]){
                    cout << "NO\n";
                    return;
                }
            }
            else {
                ok = 1;
                for (int k = 0; k < 26; k++)
                {
                    if (ha[k] > e[1][j].cnt[k]) {
                        cout << "NO\n";
                        return;
                    }
                    else for (int s = ha[k]; s < e[1][j].cnt[k]; s++)ans.push_back(k), ha[k]++;
                }
            }
            j++;
        }
    }
    cout << "YES\n";
    for (int i = 1; i <= n; i++)
    {
        int m = ans.size();
        vector<int>t;
        for (int j = 0; j < s[i].size(); j++) {
            cout << char(ans[j % m] + 'a');
            t.push_back(ans[j % m]);
        }
        cout << '\n';
        ans.swap(t);
    }
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t; cin >> t;
    while (t--)solve();
    return 0;
}