#include <bits/stdc++.h>
using namespace std;
void solve() {
  string s, ans;
  cin >> s;
  ans.push_back(s[0]);
  unordered_map<char, bool> seen;
  seen[s[0]] = 1;
  int ind = 0, n = s.size(), ok = 1;
  for (int i = 1; i < n; i++) {
    if (!seen[s[i]]) {
      if (ind == ans.size() - 1) {
        ans.push_back(s[i]);
        ind++;
      } else if (ind == 0) {
        string temp;
        temp.push_back(s[i]);
        ans.insert(0, temp);
      } else {
        ok = 0;
        break;
      }
      seen[s[i]] = 1;
    } else {
      if (ind == ans.size() - 1) {
        if (ans[ind - 1] == s[i]) {
          ind--;
        } else {
          ok = 0;
          break;
        }
      } else if (ind == 0) {
        if (ans[ind + 1] == s[i]) {
          ind++;
        } else {
          ok = 0;
          break;
        }
      } else {
        if (ans[ind - 1] == s[i])
          ind--;
        else if (ans[ind + 1] == s[i])
          ind++;
        else {
          ok = 0;
          break;
        }
      }
    }
  }
  if (!ok)
    cout << "NO"
         << "\n";
  else {
    cout << "YES"
         << "\n";
    cout << ans;
    for (char c = 'a'; c <= 'z'; c++) {
      if (!seen[c]) cout << c;
    }
    cout << "\n";
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  cin >> t;
  while (t--) solve();
  return 0;
}
