#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
  int t;
  cin >> t;
  cin.ignore();
  while (t--) {
    string s;
    getline(cin, s);
    int flag = 0;
    int arr[26] = {0};
    string ans;
    if (s.size() <= 2) {
      for (int i = 0; i < s.size(); i++) {
        ans.push_back(s[i]);
        arr[s[i] - 'a'] = 1;
      }
      for (int i = 0; i < 26; i++) {
        if (arr[i] == 0) {
          ans.push_back('a' + i);
        }
      }
      cout << "YES" << endl;
      cout << ans << endl;
      continue;
    } else {
      arr[s[0] - 'a'] = 1;
      arr[s[1] - 'a'] = 1;
      ans.push_back(s[0]);
      ans.push_back(s[1]);
      for (int i = 2; i < s.size(); i++) {
        char prev = s[i - 1];
        int in;
        for (int j = 0; j < ans.size(); j++) {
          if (ans[j] == prev) {
            in = j;
            break;
          }
        }
        if (in == ans.size() - 1) {
          if (in - 1 >= 0) {
            if (ans[in - 1] == s[i]) continue;
          }
          if (arr[s[i] - 'a'] == 0) {
            ans.push_back(s[i]);
            arr[s[i] - 'a'] = 1;
            continue;
          } else {
            cout << "NO" << endl;
            flag = 1;
            break;
          }
        }
        if (in == 0) {
          if (in + 1 < ans.size()) {
            if (ans[in + 1] == s[i]) continue;
          }
          if (arr[s[i] - 'a'] == 0) {
            string temp;
            temp.push_back(s[i]);
            ans.insert(0, temp);
            arr[s[i] - 'a'] = 1;
            continue;
          } else {
            cout << "NO" << endl;
            flag = 1;
            break;
          }
        }
        if (ans[in - 1] == s[i] || ans[in + 1] == s[i])
          continue;
        else {
          cout << "NO" << endl;
          flag = 1;
          break;
        }
      }
    }
    if (flag == 0) {
      for (int i = 0; i < 26; i++) {
        if (arr[i] == 0) {
          ans.push_back('a' + i);
        }
      }
      cout << "YES" << endl;
      cout << ans << endl;
    }
  }
  return 0;
}
