#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = (ll)mod17 * mod17;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//------------------------------------

struct Data {
	int num[26] = {};
	int sum = 0;
};
Data mk(string s) {
	Data res;
	rep(i, s.size()) {
		res.num[s[i] - 'a']++;
		res.sum++;
	}
	return res;
}
void trans(vector<int>& v, int c, int x,int y) {
	vector<int> nv;
	rep(i, v.size()) {
		if (v[i] == c) {
			nv.push_back(x);
			nv.push_back(y);
		}
		else {
			nv.push_back(v[i]);
		}
	}
	swap(v, nv);
}


void solve() {
	vector<Data> vd;
	vector<P> chs;
	int n; cin >> n;
	vector<string> s(n);
	rep(i, n)cin >> s[i];
	Data ss = mk(s[0]);
	vd.push_back(ss);
	chs.push_back({ -1,-1 });
	vector<int> cur;
	cur.push_back(0);
	//a-b
	auto dec = [&](Data& a, Data& b,int c=1) {
		rep(i, 26) {
			a.num[i] -= b.num[i]*c;
			if (a.num[i] < 0) {
				return false;
			}
		}
		a.sum -= b.sum * c;
		return true;
	};
	vector<vector<P>> mem(n);
	rep(i, n) {
		mem[i].resize(s[i].size(),P{-1,-1});
	}
	rep(i, n - 1) {
		/*cout << i << " jello " << cur.size() << "\n";
		rep(j, cur.size()) {
			cout << cur[j].num[0] << " " << cur[j].num[1] << "\n";
		}*/
		vector<int> ncur;
		string& a = s[i];
		string& b = s[i + 1];
		if (a.size() <= b.size()) {
			if (b.size() % a.size()) {
				int r = b.size() % a.size();
				int d = b.size() / a.size();
				Data rest = mk(s[i + 1]);
				Data pre = mk(s[i]);
				if (!dec(rest, pre, d)) {
					cout << "NO\n"; return;
				}
				rep(i, cur.size()) {
					//cout << "how " << i << " " << rest.sum << "\n";
					if (vd[cur[i]].sum <= rest.sum) {
						if (!dec(rest, vd[cur[i]])) {
							cout << "NO\n"; return;
						}
					}
					else {
						if (rest.sum) {
							if (!dec(vd[cur[i]], rest)) {
								cout << "NO\n"; return;
							}
							int nid = vd.size();
							vd.push_back(rest);
							chs.push_back({ -1,-1 });
							vd.push_back(vd[cur[i]]);
							chs.push_back({ -1,-1 });
							vd[cur[i]].sum = vd[nid].sum + vd[nid + 1].sum;
							chs[cur[i]] = { nid,nid + 1 };
							//cur[i] -> {nid,cur[i]};
							trans(cur, cur[i], nid, nid+1);
						}
						break;
					}
				}
			}
			rep(_, b.size() / a.size()) {
				rep(j, cur.size()) {
					ncur.push_back(cur[j]);
				}
			}
			int r = b.size() % a.size();
			int lesum = 0;
			rep(k, cur.size()) {
				if (lesum ==r)break;
				ncur.push_back(cur[k]);
				lesum += vd[cur[k]].sum;
			}
			assert(lesum == r);
		}
		else {
			Data rest = mk(s[i + 1]);
			rep(i, cur.size()) {
				if (vd[cur[i]].sum <= rest.sum) {
					if (!dec(rest, vd[cur[i]])) {
						cout << "NO\n"; return;
					}
				}
				else {
					if (rest.sum) {
						if (!dec(vd[cur[i]], rest)) {
							cout << "NO\n"; return;
						}
						int nid = vd.size();
						vd.push_back(rest);
						chs.push_back({ -1,-1 });
						vd.push_back(vd[cur[i]]);
						chs.push_back({ -1,-1 });
						vd[cur[i]].sum = vd[nid].sum + vd[nid + 1].sum;
						chs[cur[i]] = { nid,nid + 1 };
						//cur[i] -> {nid,cur[i]};
						trans(cur, cur[i], nid, nid + 1);
					}
					break;
				}
			}
			int lesum = 0;
			rep(k, cur.size()) {
				if (lesum < s[i + 1].size()) {
					ncur.push_back(cur[k]);
				}
				else {
					rep(j, vd[cur[k]].sum) {
						mem[i][lesum + j] = { cur[k],j };
					}
				}
				lesum += vd[cur[k]].sum;
			}
		}
		swap(cur, ncur);
	}
	int lesum = 0;
	rep(k, cur.size()) {
		rep(j, vd[cur[k]].sum) {
			mem[n - 1][lesum + j] = { cur[k],j };
		}
		lesum += vd[cur[k]].sum;
	}
	vector<string> forans(vd.size());
	per(i, vd.size()) {
		if (chs[i].first < 0) {
			Data& d = vd[i];
			rep(j, 26)rep(_, d.num[j]) {
				forans[i].push_back('a' + j);
			}
		}
		else {
			forans[i] = forans[chs[i].first] + forans[chs[i].second];
		}
		//cout << i << " " << vd[i].sum << " " << forans[i] << "\n";
	}
	vector<string> ans(n);
	per(i, n) {
		ans[i].resize(s[i].size());
		rep(j, s[i].size()) {
			if (i + 1 < n && j < s[i + 1].size()) {
				ans[i][j] = ans[i + 1][j];
			}
			else {
				P& p = mem[i][j]; assert(p.first >= 0);
				//cout << "? " << p.first << " " << p.second << "\n";
				ans[i][j] = forans[p.first][p.second];
			}
		}
	}
	rep(i, n - 1) {
		rep(j, ans[i + 1].size()) {
			assert(ans[i + 1][j] == ans[i][j % s[i].size()]);
		}
	}
	rep(i, n) {
		string cop = ans[i];
		sort(all(cop));
		sort(all(s[i]));
		if (s[i] != cop) {
			cout << "NO\n"; return;
		}
	}
	cout << "YES\n";
	rep(i, n)cout << ans[i] << "\n";
}



signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed<<setprecision(10);
	//init_f();
	//init();
	//while(true)
	//expr();
	int t; cin >> t; rep(i, t)
	solve();
	return 0;
}