#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long gcdf(long long a, long long b) {
  while (a != 0 && b != 0) {
    if (a > b) {
      a %= b;
    } else {
      b %= a;
    }
  }
  return max(a, b);
}
long long power(long long a, long long b, long long m) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % m;
    b /= 2;
    a = (a * a) % m;
  }
  return ans;
}
void boost() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
string st;
void dfs(vector<set<int>> &con, int fl, map<int, int> &flag) {
  if (flag[fl]) return;
  flag[fl] = 1;
  st.push_back('a' + fl);
  for (auto it = con[fl].begin(); it != con[fl].end(); it++) {
    dfs(con, *it, flag);
  }
  return;
}
int main() {
  boost();
  long long test = 1, i, j, k;
  cin >> test;
  while (test--) {
    string s;
    cin >> s;
    int n = s.size(), fl = 0;
    if (n == 1) {
      cout << "YES" << endl;
      for (i = 0; i < 26; i++) {
        cout << char('a' + i);
      }
      cout << endl;
      continue;
    }
    map<char, int> mpp;
    mpp[s[0]] = 1;
    map<int, int> flag;
    vector<set<int>> con(26);
    for (i = 1; i < n; i++) {
      con[s[i] - 'a'].insert(s[i - 1] - 'a');
      con[s[i - 1] - 'a'].insert(s[i] - 'a');
    }
    fl = -1;
    int fg = 0;
    for (i = 0; i < 26; i++) {
      if (con[i].size() == 1) fl = i;
      if (con[i].size() > 2) fg = 1;
    }
    if (fl == -1 || fg) {
      cout << "NO" << endl;
      continue;
    }
    cout << "YES" << endl;
    st = "";
    dfs(con, fl, flag);
    for (i = 0; i < 26; i++) {
      if (flag[i] == 0) {
        st.push_back('a' + i);
      }
    }
    cout << st << endl;
  }
}
