#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define range(x) (x).begin(), (x).end()
const int dir[][2] = {1, 0, -1, 0, 0, 1, 0, -1};

void solve()
{
    string s;
    cin >> s;
    vector<int> cnt(26);
    int n = s.size();
    int sz = 0;
    for (const auto &c : s)
        cnt[c - 'a']++;
    for (int i = 0; i < 26; ++i)
        sz += bool(cnt[i]);

    if (s.size() == 1) {
        cout << "YES\n";
        cout << s << '\n';
    }
    else if (sz == 1)
        cout << "NO\n";
    else if (n == 2 || n == 3) {
        cout << "YES\n";
        if (n == 2)
            cout << s << '\n';
        else {
            sort(range(s));
            if (s[0] == s[1])
                reverse(range(s));
            cout << s << '\n';
        }
    }
    else if (sz == 2)
        cout << "NO\n";
    else {
        cout << "YES\n";
        for (int i = 0; i < 26; ++i)
            if (cnt[i]) {
                cnt[i]--;
                cout << char(i + 'a');
            }
        for (int i = 0; i < 26; ++i)
            if (cnt[i]) {
                while (cnt[i]) {
                    cout << char(i + 'a');
                    cnt[i]--;
                }
            }

        cout << '\n';
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}