import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }

void main()
{
	auto T = RD!int;
	auto ans = new string[](T);
	foreach (ti; 0..T)
	{
		auto s = RD!string;
		auto edges = new bool[][](26, 26);
		if (s.length == 2)
		{
			auto l = s[0]-'a';
			auto r = s[1]-'a';
			edges[l][r] = true;
			edges[r][l] = true;
		}
		foreach (i; 1..s.length-1)
		{
			auto m = s[i]-'a';
			auto l = s[i-1]-'a';
			auto r = s[i+1]-'a';
			edges[m][l] = true;
			edges[m][r] = true;
			edges[l][m] = true;
			edges[r][m] = true;
		}
		bool ok = true;
		int[] list;
		foreach (i, e; edges)
		{
			int cnt;
			foreach (ee; e)
			{
				if (ee)
					++cnt;
			}
			if (cnt >= 3)
			{
				ok = false;
				break;
			}
			else if (cnt == 1)
			{
				list ~= cast(int)i;
			}
			else if (cnt == 0)
			{
				ans[ti] ~= cast(char)(i+'a');
			}
		}
		debug writeln(ans[ti]);
		if (!ok)
		{
			ans[ti] = [];
			continue;
		}

		auto used = new int[](26);
		void dfs(int i, int par)
		{
			used[i] = true;
			ans[ti] ~= cast(char)(i+'a');
			foreach (j; 0..26)
			{
				if (j == par) continue;
				if (edges[i][j])
				{
					dfs(j, i);
				}
			}
		}
		
		foreach (e; list)
		{
			if (used[e] == false)
				dfs(e, -1);
		}
		debug writeln(ans[ti]);
		if (ans[ti].length != 26)
			ans[ti] = [];
	}

	foreach (e; ans)
	{
		if (e.empty)
			writeln("NO");
		else
		{
			writeln("YES");
			writeln(e);
		}
	}
	stdout.flush;
	debug readln;
}