#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
typedef long long ll;
using namespace std;
typedef pair<int,int> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}


const int maxn=1e5+10;
const int maxm=5e6+10;
const int maxalp=26;

string s[maxn],rez[maxn];
int n;

struct condition{

    int pref;
    int cnt[maxalp];

    condition(){
        pref=0;
        memset(cnt,0,sizeof(cnt));
    }

    condition* moduj(condition *b){

        int k=pref/b->pref;

        if(k==0)return this;

        condition *ret=this;
        ret->pref=pref%b->pref;

        for(int i=0;i<maxalp;i++)
            ret->cnt[i]=cnt[i]-k*b->cnt[i];

        return ret;
    }

    bool operator ==(condition b){
        if(pref!=b.pref)return false;
        for(int i=0;i<maxalp;i++){
            if(cnt[i]!=b.cnt[i])return false;
        }
        return true;
    }

    bool isBad(){
        for(int i=0;i<maxalp;i++){
            if(cnt[i]<0)return true;
        }
        return false;
    }

    void ispis(){

        printf("%d | ",pref);
        for(int i=0;i<maxalp;i++)printf("%d ",cnt[i]);
        printf(" ISPIS\n");
    }

};

condition* niz[2][maxm];
bool solve(){

    int curr=0;
    for(int i=0;i<=s[n].size();i++)niz[curr][i]=NULL;

    condition *ppp=new condition();
    ppp->pref=s[n].size();
    for(int i=0;i<s[n].size();i++)ppp->cnt[s[n][i]-'a']++;
    niz[curr][s[n].size()]=ppp;

    for(int i=n-1;i>=1;i--){

        string &a=s[i];
        string &b=s[i+1];

        condition *cond=new condition();
        cond->pref=a.size();
        for(int j=0;j<a.size();j++)cond->cnt[a[j]-'a']++;

        curr^=1;
        for(int j=0;j<=a.size();j++)niz[curr][j]=NULL;
        niz[curr][a.size()]=cond;

        for(int j=0;j<=b.size();j++){
            if(niz[curr^1][j]==NULL)continue;

            condition* pom=niz[curr^1][j]->moduj(cond);

            if(niz[curr][pom->pref]==NULL)niz[curr][pom->pref]=pom;
            else{
                if((*pom)==(*niz[curr][pom->pref])){}
                else{
                    return false;
                }
            }

            if(pom->isBad()){
                return false;
            }

        }

    }

    /*int pt=1;
    int cnt[maxalp];
    memset(cnt,0,sizeof(cnt));
    for(int i=0;i<s[1].size();i++)cnt[s[1][i]-'a']++;*/

    vector<condition*>vect;
    for(int i=1;i<=s[1].size();i++)if(niz[curr][i]!=NULL)
    {vect.pb(niz[curr][i]);
        ///vect.back()->ispis();
    }

    for(int i=vect.size()-1;i>0;i--){

        for(int j=0;j<maxalp;j++){
            vect[i]->cnt[j]-=vect[i-1]->cnt[j];
            if(vect[i]->cnt[j]<0)return false;
        }
    }

    for(int i=1;i<=n;i++)rez[i].clear();
    for(int i=0;i<vect.size();i++){
        for(int j=0;j<maxalp;j++){
            while(vect[i]->cnt[j]){
                rez[1].pb('a'+j);
                vect[i]->cnt[j]--;
            }
        }
    }

    for(int i=2;i<=n;i++){
        for(int j=0;j<s[i].size();j++){
            rez[i].pb(rez[i-1][j%s[i-1].size()]);
        }
    }

    /*condition prv,pomprv;
    while(pt<=s[1].size()){

        condition *c=NULL;
        while(niz[curr][pt]==NULL)pt++;
        c=niz[curr][pt];
        pomprv=(*c);
        for(int i=0;i<maxalp;i++)c->cnt[i]-=

        for(int i=0;i<maxalp;i++)if(cnt[i]<c->)

        pt++;
    }*/

    return true;
}


int main(){

    ///freopen("test.txt","r",stdin);

    int t;
    scanf("%d",&t);
    while(t--){

        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            cin>>s[i];
        }

        if(solve()){
            printf("YES\n");

            for(int i=1;i<=n;i++)
                cout<<rez[i]<<endl;

        }
        else{
            printf("NO\n");
        }

    }


    return 0;
}