#include<bits/stdc++.h>
using namespace std;
#define FOR(i,j,k) for(int i=j;i<=k;++i)
#define For(i,j,k) for(int i=j;i>=k;--i)
struct u{
	int alpha[26];
	int exi;
}ept;
bool equal(u a,u b){
	FOR(i,0,25) if(a.alpha[i]!=b.alpha[i]) return false; 
	return true;
}
bool in_it(u a,u b){
	FOR(i,0,25) if(a.alpha[i]>b.alpha[i]) return false; 
	return true;
}
u del(u a,u b){
	FOR(i,0,25) b.alpha[i] -= a.alpha[i]; 
	return b;
}
void sol(int t){
	int n;
	cin>>n;
	vector<string> s(n+1);
	vector<int> l(n+1);
	int mxl = 0;
	FOR(i,1,n){
		cin>>s[i];
		l[i] = s[i].length();
		mxl = max(l[i],mxl);
	}
	vector<vector<u>> xz(2,vector<u>(mxl));
	vector<vector<int>> cnt(n+1,vector<int>(26));
	For(i,n,1){
		int h = i&1;
		FOR(j,0,l[i]-1) xz[h][j] = ept;
		xz[h][l[i]-1].exi = 1;
		FOR(j,0,l[i]-1){
			++xz[h][l[i]-1].alpha[s[i][j]-'a'];
			++cnt[i][s[i][j]-'a'];
		}
		if(i!=n){
			FOR(j,0,l[i+1]-1){
				if(xz[h^1][j].exi){
					if(j<=l[i]-1){
						if(!xz[h][j].exi) xz[h][j] = xz[h^1][j];
						else{
							if(!equal(xz[h][j],xz[h^1][j])){
								cout<<"NO"<<'\n';
								return;
							}
						}
					}
					else{
						u lft={};
						FOR(k,0,25){
							lft.alpha[k] = xz[h^1][j].alpha[k] - j/l[i]*cnt[i][k];
							if(lft.alpha[k]<0){
								cout<<"NO"<<'\n';
								return;
							}
						}
						if(xz[h][j%l[i]].exi){
							if(!equal(xz[h][j%l[i]],lft)){
								cout<<"NO"<<'\n';
								return;
							}
						}
						else{
							xz[h][j%l[i]] = lft;
							xz[h][j%l[i]].exi = 1;
						}
					}
				}
			}
		}
//		FOR(k,0,l[i]-1){
//			cout<<"第"<<i<<"个字符串"<<k<<"级别限制："<<endl;
//			cout<<"exi:"<<xz[i&1][k].exi<<endl;
//			FOR(j,0,25){
//				cout<<xz[i&1][k].alpha[j];
//			}
//			cout<<endl;
//		}
	}
	u now={};
	FOR(i,0,l[1]-1){
		if(xz[1][i].exi){
//			cout<<i<<"级别限制："<<endl;
//			FOR(j,0,25){
//				cout<<xz[1][i].alpha[j];
//			}
//			cout<<endl;
			if(!in_it(now,xz[1][i])){
				cout<<"NO"<<'\n';
				return;
			}
			now = xz[1][i];
		}
	}
	cout<<"YES\n";
	now = ept;
	int ccnt = 0;
	FOR(i,0,l[1]-1){
		if(xz[1][i].exi){
			u ot = del(now,xz[1][i]);
			FOR(k,0,25){
				while(ot.alpha[k]){
					s[1][ccnt++] = 'a' + k;
					--ot.alpha[k];
				}
			}
			now = xz[1][i];
		}
	}
	FOR(i,2,n){
		FOR(j,0,l[i]-1){
			s[i][j] = s[i-1][j%l[i-1]];
		}
	}
	FOR(i,1,n){
		cout<<s[i]<<'\n';
	}
}
signed main(){
//	freopen("1.in","r",stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--){
		sol(t);
	}
	return 0;
}