#include<bits/stdc++.h>
#define F(i, a, b) for(int i = a; i <= b; i ++)

using namespace std;

void sol() {
    string s; cin >> s;
    int n = s.size();
    s = " " + s;
    vector<int> cnt(26);
    int tot = 0;
    F(i, 1, n) {
        int x = s[i] - 'a';
        tot += ! cnt[x] ++;
    }
    // cout << tot << "!!\n";
    if(n == 1) {
        cout << "YES\n" << s[1] << "\n";
        return;
    }
    if(tot == 1) {
        cout << "NO\n";
        return;
    }
    int ok = 1;
    if(tot == 2) {
        ok = 0;
        F(i, 0, 25) if(cnt[i] == 1) ok = i + 1;
        if(! ok) {
            cout << "NO\n";
            return;
        }
        cout << "YES\n";
        cout << (char)(ok - 1 + 'a');
        F(i, 0, 25) if(cnt[i] && i + 1 != ok) {
            F(j, 1, cnt[i]) cout << (char)(i + 'a');
        } 
        return;
    }
    
    cout << "YES\n";
    F(i, 0, 25) if(cnt[i]) {
        cnt[i] --;
        cout << (char)(i + 'a');
    } 
    F(i, 1, n - tot) {
        F(j, 0, 25) if(cnt[j]) {
            cout << (char)(j + 'a');
            cnt[j] --;
            break;
        }
    }
    cout << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t; cin >> t;
    F(i, 1, t) sol();
    return 0;
}