
#include<bits/stdc++.h>

#define all(k) k.begin(),k.end()
#define INF 1e9
#define repk(i,a, n) for(int i=a;i<=n;i++)
#define rep(i,a, n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define ll  long long
#define ull unsigned long long
#define pci pair<int,int>
#define vc vector<char>
#define vs vector<set<pi>>
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vi>
#define vb vector<bool>
#define vpc vector<pci>
#define vvc vector<vc>
#define mi map<int,int>
#define mset map<string,set<char>>
#define umap unordered_map
 #define int int64_t
using namespace std;
#define fi first
#define se second
#define mod 1000000007
int a[]={20,36,51,60};
bool pal(string s){
  for(int i=0;i<s.size();i++){
    if(s[i]!=s[s.size()-i-1])
      return false;
  }
  return true;
}

void sol()
{string s;cin>>s;
// sort(all(s));
string b="";b+="a";
b+=s;
if(pal(b)){
  string k="";
  k+="a";
  k+=s;

  if(pal(k)){
  string t="";
  t+=s;
  t+="a";
  if(pal(t)){
    cout<<"NO\n";return;
  }
  else{
    cout<<"YES\n";
  cout<<t;
  }
  }
  else{
     cout<<"YES\n";
  cout<<k;
  }

}
else{
  cout<<"YES\n";
  cout<<b;
}


  cout<<'\n';
}



int32_t main() {

int t=1;
for(cin>>t;t;t--)
sol();
  return 0;
}
