B_Different_String.cpp

/*____________________________________________________
|Author: Ki6ui-Par1na
|Date: 2024/05/10
|Time: 20:45:06
|Problem: B_Different_String
|_____________________________________________________ */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define yes cout << "YES" << endl;
#define no cout << "NO" << endl;
#define print(n) cout << (n) << endl;
#define tc ll t; cin >> t; while(t--)

// Check Prime Number
bool is_prime(int n) {
    if (n <= 1)
        return false;
    for (int i = 2; i <= sqrt(n); i++) {
        if (n % i == 0)
            return false;
    }
    return true;
}

// Factorial Function
ll factorial(int n) {
    ll fact = 1;
    for (int i = 1; i <= n; i++) {
        fact *= i;
    }
    return fact;
}

// Composite Number Check
bool is_composite(int n) {
    return !is_prime(n);
}

// Binary Search
bool bin_search(int l, int r, int arr[], int x) {
    while (l <= r) {
        int mid = (l + r) / 2;
        if (arr[mid] == x) {
            return true;
        } else if (arr[mid] < x) {
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }
    return false;
}

// Sum of Digits
ll digit_sum(ll n) {
    ll sum = 0;
    while (n > 0) {
        sum += n % 10;
        n /= 10;
    }
    return sum;
}

void solve() {
    tc{
        string s; cin >> s;
        string ss = s;
        sort(s.begin(), s.end());
        bool flag = false;
        for(int i = 0; i < s.size() -1; i++){
            if(s[i] != s[i + 1]){
                flag = true;
                if(ss == s){
                    char temp = s[i];
                    s[i] = s[i + 1];
                    s[i + 1] = temp;
                }
                break;
            }
        }
        if(flag){
            cout << "YES\n";
            cout << s << endl;
        }
        else cout << "NO\n";
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    solve();

    return 0;
}