#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
void solve();
using pii = pair<int, int>; 
using db = double;
signed main(){
	fast
	int t = 1;
	cin >> t;
	for(int i = 1; i <= t; i++){
		solve();
	}
}

const int N = 3e5 + 10, M = N * 2, P = 998244353;

int b[35];
string ss;
void solve(){
	cin>>ss;
	if(ss.size()==1)
	{
		cout<<"YES"<<'\n';
		cout<<ss<<'\n';
		return;
	}
	memset(b,0,sizeof(b));
	for(int i=0;i<ss.size();i++)
	{
		b[(int)(ss[i]-'a')]++;
	}
	stable_sort(ss.begin(),ss.end());
	int minalp(0),cnt(0);
	for(int i=0;i<25;i++)
	{
		if(b[i])
		{
			minalp=i;
			break;
		}
	}
	for(int i=0;i<25;i++)
	{
		if(b[i])
		{
			if(b[minalp]>b[i])minalp=i;
			cnt++;
		}
	}
//	cout<<ss<<'\n';	
	if(b[minalp]==1)
	{
		cout<<"YES"<<'\n';
		int head(0);
		for(int i=0;i<ss.size();i++)
		{
			if(ss[i]==(char)(minalp+'a'))
			{head=i;break;}
		}
		cout<<(char)(minalp+'a');
		ss.erase(ss.begin()+head,ss.begin()+head+1);
		cout<<ss<<'\n';
	}
	else
	{
		if(cnt>=3)
		{
			cout<<"YES"<<'\n';
			int head(0);
			while(ss[head]==ss[0])head++;
			ss.erase(ss.begin()+1,ss.begin()+head);
			cout<<ss;
			for(int i=1;i<head;i++)cout<<ss[0];
			cout<<'\n';
		}
		else cout<<"NO"<<'\n';
	}
}