// codeforces handle -> arbazalam
// codechef handle -> arbazalam


#include <bits/stdc++.h>

#define f first
#define s second
#define pb push_back
#define mp make_pair
#define vc vector<long long int>
#define all(x) (x).begin(),(x).end()
#define ll long long
#define FAST ios_base :: sync_with_stdio (false); cin.tie (NULL)
#define rep(i,k,n) for(int i=k;i<n;i++)

using namespace std;

const ll M = 1e9 + 7;

int prime[10]={0};

void seive(int n){
    for(int i=2;i<=n;i++){
        if(prime[i])continue;
        else{
            for(int j=2*i;j<=n;j+=i)
                prime[j]=1;
        }
    }
}

bool check(string s){
    string tmp=s;
    reverse(all(tmp));
    if(tmp==s)
        return true;
    return false;
}

void solve(){
    // code below
    string s;
    cin>>s;
    int l=s.length();
    bool flag=false;
    int cnt=0;
    rep(i,0,l)if(s[i]=='a')cnt++;
    if(cnt==l)
        cout<<"NO";
    else{
        cout<<"YES\n";
        if(check('a'+s))
            cout<<s<<'a';
        else
            cout<<'a'<<s;
    }
    
}

int main(){
     FAST;
     int t=1;
     cin>>t;
     while(t--){
        solve();
        cout<<"\n";
    }
    return 0;  
}