#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n); i >= 0; i--)

void solve() {
    string s;
    cin >> s;
    if (s.size() == 1) {
        cout << "YES\n";
        cout << s << endl;
        return;
    }

    int count[26];
    rep(i, 26) count[i] = 0;
    for (auto c : s) {
        count[c - 'a']++;
    }

    vector<pair<int, char>> nz{};
    rep(i, 26) {
        if (count[i] == 0) continue;
        nz.push_back({count[i], (char)('a' + i)});
    }

    sort(all(nz));
    if (nz.size() == 1) {
        cout << "NO\n";
        return;
    }

    if (nz.size() == 2) {
        if (nz[0].first > 1) {
            cout << "NO\n";
        } else {
            string ans = "";
            ans += nz[0].second;
            rep(i, nz[1].first) { ans += nz[1].second; }
            cout << "YES\n";
            cout << ans << endl;
        }
        return;
    }

    string ans = "";
    ans += nz[0].second;
    for (int i = 1; i < nz.size(); i++) {
        auto [j, c] = nz[i];
        rep(x, j) ans += c;
    }
    rep(x, nz[0].first - 1) { ans += nz[0].second; }

    cout << "YES\n";
    cout << ans << endl;
}

int main() {
    int t;
    cin >> t;
    while (t > 0) {
        t--;
        solve();
    }
}