#include <bits/stdc++.h>
using namespace std;
vector<int> g[33];
int gt[33][33];
int deg[33];
int vis[33];
string s, ans;
int flag;
void dfs(int u, int par) {
  int i, v;
  vis[u] = 1;
  for (i = 0; flag == 1 && i < (int)g[u].size(); i++) {
    v = g[u][i];
    if (v == par) continue;
    if (vis[v] == 0) {
      dfs(v, u);
    }
  }
  ans.push_back(char(u + 'a' - 1));
}
int check() {
  int i, j, a, b;
  for (i = 1; i < (int)s.size(); i++) {
    for (j = 0; j < 26; j++) {
      if (s[i] == ans[j]) {
        a = j;
        break;
      }
    }
    for (j = 0; j < 26; j++) {
      if (s[i - 1] == ans[j]) {
        b = j;
        break;
      }
    }
    if (abs(a - b) != 1) return 0;
  }
  return 1;
}
void solve() {
  memset(gt, 0, sizeof gt);
  memset(deg, 0, sizeof deg);
  memset(vis, 0, sizeof vis);
  int i, j, k;
  for (i = 0; i <= 26; i++) {
    g[i].clear();
  }
  flag = 1;
  for (i = 1; i < (int)s.size(); i++) {
    int x = s[i - 1] - 'a' + 1;
    int y = s[i] - 'a' + 1;
    g[x].push_back(y);
    g[y].push_back(x);
    if (gt[x][y] == 0) {
      deg[x]++;
      deg[y]++;
    }
    gt[x][y] = 1;
    gt[y][x] = 1;
    if (deg[x] > 2 || deg[y] > 2) {
      cout << "NO\n";
      return;
    }
  }
  ans = "";
  j = 0;
  for (i = 1; i <= 26; i++) {
    if (deg[i] == 1 && vis[i] == 0) {
      dfs(i, -1);
      j = i;
    }
  }
  for (i = 1; i <= 26; i++) {
    if (deg[i] == 1) continue;
    if (vis[i] == 0) {
      dfs(i, -1);
    }
  }
  if (flag == 0) {
    cout << "NO\n";
    return;
  }
  flag = check();
  if (flag == 0) {
    cout << "NO\n";
    return;
  }
  cout << "YES\n";
  cout << ans << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int q;
  cin >> q;
  while (q--) {
    cin >> s;
    solve();
  }
  return 0;
}
