#include<bits/stdc++.h>
using namespace std;
#define i64 long long
#define i128 __int128
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
void Solve(void) {
  string S; cin >> S;
  vector<int> cnt(26, 0), cnt1(26, 0);
  vector<int> cs;
  for (int i = 0; i < (int)S.size(); i ++) {
    cnt[S[i] - 'a'] ++;
    cnt1[S[i] - 'a'] ++;
    cs.pb(S[i] - 'a');
  }
  sort(all(cs)); cs.erase(unique(all(cs)), cs.end());
  int p = 0, p1 = 1, sz = cs.size();
  vector<char> ans, ans1;
  for (int i = 0; i < (int)S.size(); i ++) {
    while (cnt[cs[p]] == 0) p = (p + 1) % sz;
    ans.pb(char(cs[p] + 'a'));
    cnt[cs[p]] --;
    p = (p + 1) % sz;

    while (cnt1[cs[p1]] == 0) p1 = (p1 + 1) % sz;
    ans1.pb(char(cs[p1] + 'a'));
    cnt1[cs[p1]] --;
    p1 = (p1 + 1) % sz;
  }

  bool flag = true, flag1 = true;
  if ((int)ans.size() > 1 && ans[1] == ans[0] || (int)ans.size() > 2 && ans[2] == ans[0]) flag = false;
  if ((int)ans1.size() > 1 && ans1[1] == ans1[0] || (int)ans1.size() > 2 && ans1[2] == ans1[0]) flag1 = false;
  if (!flag && !flag1) {
    cout << "NO" << "\n";
    return;
  }
  cout << "YES" << "\n";
  if (flag) {
    for (auto x : ans) cout << x; cout << "\n";
  }
  else if (flag1) {
    for (auto x : ans1) cout << x; cout << "\n";
  }
}
signed main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
  cout << fixed << setprecision(10);
  int Tests = 1; cin >> Tests;
  while (Tests --) {
    Solve();
  }
}