#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int T,n,box[26];
char s[1000010];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>T;
	while(T--)
	{
		cin>>s+1;
		n=strlen(s+1);
		memset(box,0,sizeof(box));
		int cnt=0;
		for(int i=1;i<=n;i++)
		{
			cnt+=!(box[s[i]-'a']++);
		}
		int minn=1e9,p;
		for(int i=0;i<26;i++)
		{
			if(box[i]&&box[i]<minn)
			{
				minn=box[i];
				p=i;
			}
		}
		s[n=1]=p+'a';
		for(int i=0;i<26;i++)
		{
			if(i==p)
			{
				continue;
			}
			while(box[i]--)
			{
				s[++n]=i+'a';
			}
		}
		while(--box[p])
		{
			s[++n]=p+'a';
		}
		if((cnt==1&&n>1)||cnt==2&&minn==2)
		{
			cout<<"NO"<<endl;
			continue;
		}
		cout<<"YES"<<endl<<s+1<<endl;
	}
	return 0;
}