#include <bits/stdc++.h>
#define ll long long
#define Ma 1000005
#define mod 998244353
#define PLL pair<ll,ll>
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define N 26
#define all(x) x.begin(),x.end()
#define pb push_back

using namespace std;

char a[Ma];
string s;
ll f[N];
ll n;
struct node{
	ll num,w;
	bool operator <(const node &A) const{
		return w<A.w;
	}
}t[N];


void sol()
{
	ll tot=0;
	memset(f,0,sizeof(f));
	cin>>s;
	n=s.size();
	ll cnt=0;
	for (ll i=0;i<s.size();i++)
		f[s[i]-'a']++,cnt+=(f[s[i]-'a']==1);
	for (ll i=0;i<N;i++)
		t[i]={i,f[i]};
	sort(t,t+N);
	if (cnt==1&&n!=1)
	{
		printf("NO\n");
		return;
	}
	if (cnt==2)
	{
		ll flag=0;
		for (ll i=0;i<N;i++)
			flag|=(f[i]==1);
		if (!flag)
		{
			printf("NO\n");
			return;
		}
	}
	printf("YES\n");
	while (cnt)
	{
		for (ll i=0;i<N;i++)
		{
			if (!t[i].w)
				continue;
			t[i].w--;
			a[tot++]=t[i].num+'a';
			if (!t[i].w)
				cnt--;
		}
	}
	for (ll i=0;i<tot;i++)
		printf("%c",a[i]);
	printf("\n");
}


int main()
{
	ll tt=1;
	cin>>tt;
	while (tt--)
		sol();
	return 0;
}