#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
using namespace std;
 
#define speed ios_base::sync_with_stdio(false),cout.tie(0),cin.tie(0)
#define fre freopen("in.txt","r",stdin),freopen("out.txt","w",stdout)
#define N 2*1000005
#define M 2002
#define st first
#define nd second
#define endl "\n"
#define pii pair<ll,ll>
#define pb push_back
#define mp make_pair
#define inf 1e9+7
#define mid (start+end)/2
#define sp " "
#define Endl endl
#define mod 1000000007
typedef long long int ll;
 
ll n,m,k,ans;

string s;

void solve(){
    cin>>s;
    n=s.length();
    ll k=0;
    for (int i = 0; i < s.length(); ++i)
    {
        if(s[i]!='a')
            k=1;
    }
    if(k==0)
        cout<<"NO\n";
    else{
        cout<<"YES\n";
        ll p=-1;
        for (int i = n-1; i >= 0; --i)
        {
            if(s[i]!='a'){
                p=i;
                break;
            }
        }
        ll pp=n-p-1;
        for (int i = 0; i < pp; ++i)
        {
            cout<<s[i];
        }
        cout<<'a';
        for (int i = pp; i < n; ++i)
        {
            cout<<s[i];
        }
        cout<<endl;
    }
} 
 
int main()
{
    speed;
    //fre; 
    int TT=1;
    cin>>TT;
    while(TT--)solve();


    return 0;
} 