#include<bits/stdc++.h>

using i64 = long long;
using l64 = long double;

void DAOQI() {
    std::string s, t;
    std::cin >> s;
    if (s.size() == 1) {
        std::cout << "YES\n";
        std::cout << s << "\n";
        return;
    }
    std::map<char, int> mp;
    std::vector<int> a(26);
    for (char c: s) mp[c]++, a[c - 'a']++;
    if (mp.size() == 1) {
        std::cout << "NO\n";
        return;
    }
    if (mp.size() == 2) {
        for (auto [v, c]: mp) {
            if (c == 1) {
                std::cout << "YES\n";
                std::string ans;
                ans += v;
                for (auto [v1, c1]: mp) {
                    if (v1 == v) continue;
                    ans += std::string(c1, v1);
                }
                std::cout << ans << "\n";
                return;
            }
        }
        std::cout << "NO\n";
        return;
    }
    int n = s.size();
    std::cout << "YES\n";
    std::string ans;
    while (n) {
        for (int i = 0; i < 26; i++) {
            if (a[i]) {
                a[i]--, n--;
                ans += char(i + 'a');
            }
        }
    }
    std::cout << ans << "\n";
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T = 1;
    std::cin >> T;
    while (T--) DAOQI();
    return 0;
}