#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
struct node{
    int len;
    int t[27];
    node(){
        len=0;
        for(int i=1;i<=26;i++) t[i]=0;
    }
    bool operator <(const node& other) const{
        return len<other.len;
    }
};
int n;
string s[N];
int p[N][27];
priority_queue<node,vector<node>,less<node>> q;
int now[27];
string ans[N];
bool solve(){
    for(int i=1;i<=n;i++) ans[i].clear();
    for(int i=1;i<=26;i++) now[i]=0;
    while(!q.empty()) q.pop();
    for(int i=n;i>=1;i--){
        node tmp;
        for(int j=1;j<=26;j++){
            tmp.len+=p[i][j];
            tmp.t[j]=p[i][j];
        }
        q.push(tmp);

        if(i!=1){
            while(!q.empty() && q.top().len>=s[i-1].length()){
                node t1=q.top();q.pop();
                int k=t1.len/s[i-1].length();
                t1.len%=s[i-1].length();
                for(int j=1;j<=26;j++){
                    t1.t[j]-=p[i-1][j]*k;
                    if(t1.t[j]<0) return 0;
                }
                if(t1.len>0) q.push(t1);
            }    
        }
    }
    vector<node> vec;
    while(!q.empty()){
        vec.push_back(q.top());
        q.pop();
    }
    reverse(vec.begin(),vec.end());
    for(auto x:vec){
        for(int i=1;i<=26;i++){
            if(now[i]>x.t[i]) return 0;
            if(x.t[i]>p[1][i]) return 0;
            for(int k=1;k<=x.t[i]-now[i];k++){
                ans[1].push_back('a'+i-1);
            }
            now[i]=x.t[i];
        }
    }

    printf("YES\n");
    cout<<ans[1]<<endl;
    for(int i=2;i<=n;i++){
        int now=0;
        for(int j=1;j<=s[i].length();j++){
            ans[i].push_back(ans[i-1][now]);
            now=(now+1)%ans[i-1].length();
        }
        cout<<ans[i]<<endl;
    }
    return 1;
}
int T;
void solve0(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        cin>>s[i];
        for(int j=1;j<=26;j++) p[i][j]=0;
        for(auto x:s[i]){
            p[i][x-'a'+1]++;
        }
    }
    if(solve()){}
    else{
        printf("NO\n");
    }
}
int main(){
    scanf("%d",&T);
    while(T--) solve0();
    return 0;
}
/*
4
2
abc
abcd
4
bbcaa
cabb
acabbbb
a
3
ab
aab
bbaaaaab
3
ab
aab
bbaaaaaa
*/