//#pragma GCC optimize(3,"Ofast","inline")
//#pragma GCC optimize("-Ofast","-funroll-all-loops")
#include<bits/stdc++.h>
//#define getchar nc
#define sight(c) ('0'<=c&&c<='9')
#define LL long long
#define debug(a) cout<<#a<<" is "<<a<<"\n"
#define dput(a) puts("a")
#define eho(x) for(int i=head[x];i;i=net[i])
#define fi first
#define se second
inline char nc(){
static char buf[1000000],*p1=buf,*p2=buf;
return p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++;
}
template <class T>
inline void read(T &x){// unsigned
    static char c;
    for (c=getchar();!sight(c);c=getchar());
    for (x=0;sight(c);c=getchar())x=x*10+c-48;
}
template <class T> void write(T x){if (x<10) {putchar('0'+x); return;} write(x/10); putchar('0'+x%10);}
template <class T> inline void writeln(T x){ if (x<0) putchar('-'),x*=-1; write(x); putchar('\n'); }
template <class T> inline void writel(T x){ if (x<0) putchar('-'),x*=-1; write(x); putchar(' '); }
using namespace std;
#define N 100007
#define char_len 5000007
int len[N];
char ch[char_len],CH[2][char_len];
void Gen(int id,char *last,char *now){
	for (int i=0;i<len[id+1];i++)
		now[i]=last[i%len[id]];
	now[len[id+1]]=0;
}
int n,p[N][27],lim[char_len],li[char_len][27],la[char_len];
int sta[N],stb[N],tot,tmp[27];
bool cmp(int x,int y){
	return len[x]<len[y];
}
void solve() {
	scanf("%d",&n);
	for (int i=1;i<=n;i++) {
		scanf("%s",ch);
		len[i]=strlen(ch);
		for (int j=0;j<26;j++) p[i][j]=0;
		for (int j=0;j<len[i];j++) p[i][ch[j]-'a']++; 
	}
	for (int i=0;i<=len[1];i++) lim[i]=0;
	lim[len[1]]=1;
	for (int i=0;i<26;i++) li[len[1]][i]=p[1][i];
	lim[0]=1;
	for (int i=0;i<26;i++) li[0][i]=0;
	tot=0;
	sta[++tot]=1; stb[tot]=len[1];
	for (int i=2;i<=n;i++) {
		int now=len[i];
		for (int j=0;j<26;j++) tmp[j]=p[i][j];
		while (stb[tot]>now) tot--;
		while (1) {
			int x=upper_bound(stb+1,stb+tot+1,now)-stb;
//			cerr<<x<<endl;
			x--;
			if (x==0) break; 
			x=sta[x];
			int newnow=now%len[x],sz=now/len[x];
			for (int j=0;j<26;j++) {
				tmp[j]=tmp[j]-sz*p[x][j];
				if (tmp[j]<0) {
					puts("NO");
					return;
				} 
			}
			now=newnow;
		}
		sta[++tot]=i; stb[tot]=len[i];
		if (lim[now]) {
			for (int j=0;j<26;j++) {
				if (tmp[j]!=li[now][j]) {
					puts("NO");
					return;
				}
			}
		} else {
			lim[now]=1;
			for (int j=0;j<26;j++) li[now][j]=tmp[j];
		}
	}
	int las=0;
	for (int i=1;i<=len[1];i++) {
		la[i]=las;
		if (lim[i]) las=i;	
	}
	for (int i=len[1];i>=1;i--) {
		if (lim[i]==0) continue;
		for (int j=0;j<26;j++) {
			li[i][j]-=li[la[i]][j];
			if (li[i][j]<0) {
				puts("NO");
				return;
			}
		}
	}
	for (int i=len[1];i>=1;--i) {
		if (lim[i]) {
			for (int j=0;j<26;j++) tmp[j]=li[i][j];
		}
		for (int j=0;j<26;j++) {
			if (tmp[j]) {
				CH[0][i]='a'+j;
				tmp[j]--;
				break;
			}
		}
	}
	CH[0][len[1]+1]=0;
	puts("YES");
	int now=1,last=0;
	for (int i=1;i<=n;i++) {
		printf("%s\n",CH[last]+1);
		if (i!=n) {
			Gen(i,CH[last]+1,CH[now]+1);
			last^=1; now^=1;
		}
	}
} 
int T;
signed main() {
	#ifdef LOCAL
	//	freopen("test.in", "r", stdin);
	//	freopen("test.out", "w", stdout);
	#endif
	scanf("%d",&T);
	while (T--) solve();
    return 0;
}
/*
4
2
abc
abcd
4
bbcaa
cabb
acabbbb
a
3
ab
aab
bbaaaaab
3
ab
aab
bbaaaaaa

1
15
baaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbb
ba
bababababababababababababababababababababab
bababababababababababababababab
babababab
bababababbababababb
bababababbabab
baba
bababababababab
b
bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb
b
bbbbbbbbbbbbbb
bbbbbbbbbbbbbb
bbbbbbbbbbbbbbbbbbbbbbb
*/