#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void solve()
{
    string s;
    cin >> s;
    vector<int> cnt(26);
    for (auto c : s) ++cnt[c - 'a'];
    int sum = 0;
    for (int i = 0; i < 26; ++i) if (cnt[i] > 0) ++sum;
    if (sum == 1)
    {
        if (s.size() == 1)
        {
            cout << "YES" << endl;
            cout << s << endl;
        }
        else
        {
            cout << "NO" << endl;
        }
    }
    else if (sum == 2)
    {
        int id = -1;
        for (int i = 0; i < 26; ++i) if (cnt[i] == 1) id = i;
        if (id >= 0)
        {
            int id2 = -1;
            for (int i = 0; i < 26; ++i)
            {
                if (id == i) continue;
                if (cnt[i] > 0)
                {
                    id2 = i;
                    break;
                }
            }
            cout << "YES" << endl;
            cout << char('a' + id);
            for (int i = 1; i < s.size(); ++i) cout << char('a' + id2);
            cout << endl;
        }
        else
        {
            cout << "NO" << endl;
        }
    }
    else
    {
        vector<pair<int, char>> cv;
        for (int i = 0; i < 26; ++i)
        {
            if (cnt[i] > 0)
            {
                cv.emplace_back(cnt[i], 'a' + i);
            }
        }
        sort(cv.rbegin(), cv.rend());
        string ans;
        while (!cv.empty())
        {
            int siz = cv.size();
            for (int i = siz - 1; i >= 0; --i)
            {
                ans.push_back(cv[i].second);
                --cv[i].first;
            }
            while (!cv.empty() && cv.back().first == 0) cv.pop_back();
        }
        cout << "YES" << endl;
        cout << ans << endl;
    }
}

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