#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int Mod = 1e9 + 7;
inline void uadd(int &a, const int &b){ a += b - Mod; a += (a>>31) & Mod; }
inline int add(int a, const int &b){ a += b - Mod; a += (a>>31) & Mod; return a; }
inline void usub(int &a, const int &b){ a -= b; a += (a>>31) & Mod; }
inline int sub(int a, const int &b){ a -= b, a += (a>>31) & Mod; return a; }
inline void umul(int &a, const int &b){ a = (int)(1ll * a * b % Mod); }
inline int mul(const int &a, const int &b){ return (int)(1ll * a * b % Mod); }
int qpow(int b, ll p){ int ret = 1; while(p){ if(p & 1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 100;
int fact[fN], invfact[fN];
void initfact(int n){
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i - 1], i);
	invfact[n] = qpow(fact[n], Mod - 2); for(int i = n; i >= 1; --i) invfact[i - 1] = mul(invfact[i], i);
}
inline int binom(int n, int m){
	//cout << "binom " << n << " " << m << " = " << mul(fact[n], mul(invfact[m], invfact[n - m])) << endl;
	return mul(fact[n], mul(invfact[m], invfact[n - m]));
}
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
template<typename T> inline void chmax(T &a, const T &b){ (b>a) ? (a=b) : a; }
template<typename T> inline void chmin(T &a, const T &b){ (b<a) ? (a=b) : a; }

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	int T;
	cin >> T;
	while(T--){
		string s;
		cin >> s;
		map<char, int> cnt;
		rep(i, (int)s.size()) ++cnt[s[i]];
		if(cnt.size() > 2){
			char c0 = (cnt.begin() -> first), c1 = prev(cnt.end()) -> first;
			cout << "YES\n" << c0 << c1;
			rep(i, 26) if((i + 'a') != c0 && (i + 'a') != c1){
				rep(j, cnt[(char)(i + 'a')]) cout << (char)(i + 'a');
			}
			rep(i, cnt[c0] - 1) cout << c0;
			rep(i, cnt[c1] - 1) cout << c1;
			cout << "\n";
		} else if(cnt.size() < 2){
			if(s.size() == 1){
				cout << "YES\n" << s << "\n";
			} else {
				cout << "NO\n";
			}
		} else {
			sort(s.begin(), s.end());
			char c0 = (cnt.begin() -> first), c1 = prev(cnt.end()) -> first;
			if(cnt[c0] == 1){
				cout << "YES\n" << s << "\n";
			} else if(cnt[c1] == 1){
				reverse(s.begin(), s.end());
				cout << "YES\n" << s << "\n";
			} else {
				cout << "NO\n";
			}
		}
	}

	return 0;
}