#include <bits/stdc++.h>

void solve() {
    std::string s;
    std::cin >> s;

    std::vector<int> cnt(26);
    for (char c : s) {
        cnt[c - 'a'] += 1;
    }

    if (auto it = std::find(cnt.begin(), cnt.end(), 1); it != cnt.end()) {
        char c = 'a' + (it - cnt.begin());
        int p = std::find(s.begin(), s.end(), c) - s.begin();
        std::swap(s[0], s[p]);
        std::cout << "YES\n";
        std::cout << s << '\n';
        return;
    }

    int tot = 0;
    for (int i : cnt) {
        if (i) {
            ++tot;
        }
    }

    if (tot <= 2) {
        std::cout << "NO\n";
        return;
    }

    auto get = [&](std::set<int> exc) -> int {
        for (int i = 0; i < cnt.size(); ++i) {
            if (cnt[i] && exc.find('a' + i) == exc.end()) {
                --cnt[i];
                return 'a' + i;
            }
        }
        return -1;
    };

    char c = get({});
    get({});
    s[0] = s[2] = c;
    s[1] = get({s[0]});
    s[2] = get({s[0], s[1]});
    for (int i = 3; i < s.size(); ++i) {
        s[i] = get({});
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }
}