#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long MAXN = 100 + 5;
string s;
bool vis[MAXN];
char ch[MAXN];
int start;
bool flag;
void solve() {
  memset(vis, 0, sizeof(vis));
  memset(ch, 0, sizeof(ch));
  flag = true;
  start = 50;
  for (int i = 0; i < s.size(); i++) {
    char c = s[i];
    if (!vis[c - 'a']) {
      vis[c - 'a'] = 1;
      if (!isalpha(ch[start]))
        ch[start] = c;
      else if (!isalpha(ch[start + 1]))
        ch[start + 1] = c, start++;
      else if (!isalpha(ch[start - 1]))
        ch[start - 1] = s[i], start--;
      else {
        flag = false;
        break;
      }
    } else {
      if (c == ch[start])
        continue;
      else if (c == ch[start - 1])
        start--;
      else if (c == ch[start + 1])
        start++;
      else {
        flag = false;
        break;
      }
    }
  }
  if (!flag) {
    cout << "NO" << endl;
    return;
  }
  cout << "YES" << endl;
  memset(vis, 0, sizeof(vis));
  for (int i = MAXN; i >= 0; i--) {
    if (isalpha(ch[i])) {
      cout << ch[i];
      vis[ch[i] - 'a'] = 1;
    }
  }
  for (int i = 0; i < 26; i++) {
    char temp = 'a' + i;
    if (!vis[i]) cout << temp;
  }
  cout << endl;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int T;
  cin >> T;
  while (T--) {
    cin >> s;
    solve();
  }
  return 0;
}
