Problem: A palindrome is a string that reads the same backward as forward. For example, the strings "z", "aaa", "aba", and "abccba" are palindromes, but "codeforces" and "ab" are not. You hate palindromes because they give you déjà vu.

There is a string s. You must insert exactly one character 'a' somewhere in s. If it is possible to create a string that is not a palindrome, you should find one example. Otherwise, you should report that it is impossible.

For example, suppose s= "cbabc". By inserting an 'a', you can create "acbabc", "cababc", "cbaabc", "cbabac", or "cbabca". However "cbaabc" is a palindrome, so you must output one of the other options.

Input

The first line contains a single integer t (1≤ t≤ 10^4) — the number of test cases.

The only line of each test case contains a string s consisting of lowercase English letters.

The total length of all strings does not exceed 3⋅ 10^5.

Output

For each test case, if there is no solution, output "NO".

Otherwise, output "YES" followed by your constructed string of length |s|+1 on the next line. If there are multiple solutions, you may print any.

You can print each letter of "YES" and "NO" in any case (upper or lower).

Example

Input


6
cbabc
ab
zza
ba
a
nutforajaroftuna


Output


YES
cbabac
YES
aab
YES
zaza
YES
baa
NO
YES
nutforajarofatuna

Note

The first test case is described in the statement.

In the second test case, we can make either "aab" or "aba". But "aba" is a palindrome, so "aab" is the only correct answer.

In the third test case, "zaza" and "zzaa" are correct answers, but not "azza".

In the fourth test case, "baa" is the only correct answer.

In the fifth test case, we can only make "aa", which is a palindrome. So the answer is "NO".

In the sixth test case, "anutforajaroftuna" is a palindrome, but inserting 'a' elsewhere is valid.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define N 1000005
typedef long long ll;
const ll LLINF=(ll)(1e18);
// const int mx=1e5+7;
// int n,m;
// bool visited[mx];
//vector<int> a(mx),b(mx);
//vector<int> g(mx);
// int deg[mx], val[mx];
// vector<int> adj[mx];
// int col[mx], d[mx];
// vector<int> ans;
//---dfs--
//vector<ll> val(mx);
// ll leaf[mx], a[mx];
// ll ans=0;
// int sz=0;
// void dfs(int s, int e){
// 	//if(visited[s]) return;
// 	//visited[s]=true;
// 	if(adj[s].size()==0) leaf[s]=1;
// 	for(int i:adj[s]){
// 		if(i!=e){
// 			dfs(i,s);
// 			val[s]+=val[i];
// 			leaf[s]+=leaf[i];
// 		}
// 	}
// 	val[s]+=a[s];
// 	ans=max(ans,(val[s]+leaf[s]-1)/leaf[s]);
// }
//---dfs---

//---primes---
// const ll N = 1e6 + 10;

// bool prime[N];
 
// int spf[N];
 
// void calc(){
// 	for(ll i = 2; i<=1e3; i++){
// 		if(prime[i])
// 			continue;
// 		spf[i] = i;
// 		for(ll j = i * i; j < N; j += i){
// 			prime[j] = 1;
// 			spf[j] = i;
// 		}
// 	}
// 	for(ll i = 2; i < N; i++)
// 		if(!spf[i])
// 			spf[i] = i;
// }

// vector<pair<ll,ll>> getp(ll x){
// 	ll curr=x;
// 	vector<pair<ll,ll>> ans;
// 	while(curr>1){
// 		ll a=spf[curr];
// 		ll count=0;
// 		while(curr%a==0){ curr/=a; count++;}
// 		ans.push_back(make_pair(a,count));
// 	}
// 	return ans;
// }

// bool ispr(ll n) {
// 	if(n==1) return false;
//     for (ll i=2;i*i<=n;++i){
//         if(n%i==0){
//             return false;
//         }
//     }
//     return true;
// }
//---primes---

//---segment_tree---
// int upd(int t,int val,int l,int r,int y, int z){
// 	if(y<l||y>r) return tr[val];
// 	if(l==r) return tr[val]=z;
// 	int s=(l+r)/2;
// 	upd(t^1,2*val+1,l,s,y,z);
// 	upd(t^1,2*val+2,s+1,r,y,z);
// 	if(t) tr[val]=tr[2*val+1]|tr[2*val+2];
// 	else tr[val]=tr[2*val+1]^tr[2*val+2];
// 	return tr[val];
// }
//int query(){}
//---segment_tree---


//const int maxn = 2e5+7;
//const ll MOD = 998244353;

// ll fact[maxn], inv[maxn];

// ll deg(ll x, ll d){
// 	if(d<0) d+=MOD-1;
// 	ll y=1;
// 	while(d){
// 		if(d&1) (y*=x)%=MOD;
// 		d/=2;
// 		(x*=x)%=MOD;
// 	}
// 	return y;
// }

// ll cnk(ll n, ll k){
// 	if(k<0||k>n) return 0;
// 	return fact[n]*inv[k]%MOD*inv[n-k]%MOD;
// }



//long long C(int n, int m) {
// 	long long res = 1;
// 	for (int i = 0; i < m; ++i) {
// 		res = res * (n - i) / (i + 1);
// 	}
// 	return res;
// }


// ll power(ll x,ll y){
//     ll res=1;
//     if(x==0) return 0;
//     while(y>0){
//         if(y&1) res = (res*x)%MOD ;  
//         y=y>>1;
//         x=(x*x)%MOD;   
//     } 
//     return res; 
// }

// ll add(ll x,ll y){
//     x += y;
//     while(x >= MOD) x -= MOD;
//     while(x < 0) x += MOD;
//     return x;
// }

// ll mul(ll x, ll y){
//     return (x * 1ll * y) % MOD;
// }

// ll divide(ll x, ll y){
// 	return mul(x,power(y,MOD-2));
// }

bool pal(string s){
	bool ok=true;
	int n=(int)s.size();
	for(int i=0;i<n/2;i++){
		if(s[i]!=s[n-1-i]){
			ok=false;
			break;
		}
	}
	return ok; 
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<setprecision(25);
	int T;
	cin>>T;
	while(T--){
        string s;
		cin>>s;
		string l='a'+s, r=s+'a';
		if(!pal(l)){
			cout<<"YES\n";
			cout<<l<<"\n";
		}
		else if(!pal(r)){
			cout<<"YES\n";
			cout<<r<<"\n";
		}
		else{
			cout<<"NO\n";
		}
 	}		
}