#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
//#define int long long
//#define LL long long
#define double long double
//#define lf Lf
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define endl "\n"
#define PII pair<int,int>
#define Gheap priority_queue<int,vector<int>,greater<int>>
#define Lheap priority_queue<int>
#define MAXN 0x3f3f3f3f
#define MINN -0x3f3f3f3f
using namespace std;
//const int N=1e6+100,M=2*N;
//int e[N],w[M],h[M],ne[M],idx;

void solve()
{
	unordered_map<char,int> mp,sin;
    string s;
    cin>>s;
    int fg=0;
    for(auto z:s) mp[z]++;

    for(auto &z:mp)
    {
    	if(z.se==1)
    	{
    		fg=1;
    		sin[z.fi]=1;
    		z.se=0;
    	}
    }

    if(mp.size()==1 and s.size()>1)
    {
    	cout<<"NO"<<endl;
    	return;
    }

    if(fg or mp.size()>=3)
    {
    	cout<<"YES"<<endl;
    	for(auto z:sin) cout<<z.fi;

    	while(1)
    	{
    		int ok=1;
    		for(auto &z:mp)
    		{
    			if(z.se>0) 
    			{
    				ok=0;
    				cout<<z.fi;
    				z.se--;
    			}
    		}
    		if(ok==1) break;
    	}

    	cout<<endl;
    }
    else cout<<"NO"<<endl;

}


int main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tt=1;
    cin >> tt;
    while(tt--) solve();
}

//sssuuuzzz
//hhjjj
//hjhjh