#include <bits/stdc++.h>
#include <string>
using namespace std;


//---------------------------------------------Debug---------------------------------------------------------------------
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}


// ---------------------------------------------------------Defines----------------------------------------------------------
#define PI               2*acos(0.0)
#define mem(a,b)         memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define EPS              10E-10
#define ff               first
#define ss               second
#define mod              1000000007
#define fast_cin         ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define sz(a)            (int)a.size()
#define UNIQUE(v)        (v).erase(unique((v).begin(),(v).end()),(v).end())
#define all(a)           a.begin(),a.end()
#define infinity         0x3f3f3f3f
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))
#define endl             "\n"
#define D(x)            cerr << __LINE__ << ": " << #x << " = " << (x) << '\n'
#define DBG              cerr << __LINE__ << ": Hi" << '\n'
//-----------------------------------------------------------Types-----------------------------------------------------------
typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii>vii;
typedef vector<pll>vll;

////----------------------Graph Moves----------------
const int fx[]={+1,-1,+0,+0};
const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

/*-----------------------Bitmask------------------*/
ll Set(ll &N, ll pos) {return N = N | (1 << pos);}
ll reset(ll &N, ll pos) {return N = N & ~(1 << pos);}
bool check(ll N, ll pos) {return (bool)(N & (1 << pos));}
/*------------------------------------------------*/

void init() {
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
    fast_cin;
// #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
// #endif
}

// bool isPrime ( ll n ) {
//     if ( n <= 1 ) return false;
//     int sqrtn = sqrt(n);
//     for ( ll i = 2; i <= sqrtn; i++ ) {
//         if ( n % i == 0 ) return false;
//     }
//     return true;
// }


void Binary(ll x)
{
    for (int  i = 32; i >= 0; i--) {
        if ((1 << i)&x)cerr << "1";
        else cerr << "0";
    }
    cerr << "\n";
}
bool cmp(const pair<int, int> &a,
         const pair<int, int> &b)
{
    return (a.second > b.second);
}

ll ncr(int n,int r){
	// (n-1)ck + (n-1)c(k-1) = nck;
   	ll ans = 1;
   	if(r > n-r)r = n-r;
   	for(ll i = 1;i<=r;i++){
   		ans*=(n-i+1), ans/=i;
   	}return ans;
}

ll pow(ll a, ll b) {
    ll res = 1;
    while (b > 0) {
        if (b & 1)res = (res * a) % mod;
        b >>= 1;
        a = (a * a) % mod;
    }
    return res;
}

void solve(){
	string s;cin >> s;
	if(count(all(s), 'a') == sz(s)){
		cout << "NO\n";
		return;
	}
	cout << "YES\n";
	// int ind;
	// int n = sz(s);
	string t = s + 'a';
	bool flag =0;
	for(int i = 0;i<sz(t)/2;i++){
		if(t[i] != t[sz(t)-i-1])flag = 1;
	}
	if(flag){
		cout << t<< endl;
	}
	else{
		cout << 'a';
		cout << s <<endl;
	}
	
}

int main() {
    init();
	// int tc = 1;
	// cout << "Case " << tc++ << ": ";
    int t;cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}
 
### Prompt

Create a solution in cpp for the following 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.

### Response

```cpp
#include <bits/stdc++.h>
#include <string>
using namespace std;


//---------------------------------------------Debug---------------------------------------------------------------------
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}


// ---------------------------------------------------------Defines----------------------------------------------------------
#define PI               2*acos(0.0)
#define mem(a,b)         memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define EPS              10E-10
#define ff               first
#define ss               second
#define mod              1000000007
#define fast_cin         ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define sz(a)            (int)a.size()
#define UNIQUE(v)        (v).erase(unique((v).begin(),(v).end()),(v).end())
#define all(a)           a.begin(),a.end()
#define infinity         0x3f3f3f3f
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))
#define endl             "\n"
#define D(x)            cerr << __LINE__ << ": " << #x << " = " << (x) << '\n'
#define DBG              cerr << __LINE__ << ": Hi" << '\n'
//-----------------------------------------------------------Types-----------------------------------------------------------
typedef long long ll;
typedef double db;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii>vii;
typedef vector<pll>vll;

////----------------------Graph Moves----------------
const int fx[]={+1,-1,+0,+0};
const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

/*-----------------------Bitmask------------------*/
ll Set(ll &N, ll pos) {return N = N | (1 << pos);}
ll reset(ll &N, ll pos) {return N = N & ~(1 << pos);}
bool check(ll N, ll pos) {return (bool)(N & (1 << pos));}
/*------------------------------------------------*/

void init() {
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
    fast_cin;
// #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
// #endif
}

// bool isPrime ( ll n ) {
//     if ( n <= 1 ) return false;
//     int sqrtn = sqrt(n);
//     for ( ll i = 2; i <= sqrtn; i++ ) {
//         if ( n % i == 0 ) return false;
//     }
//     return true;
// }


void Binary(ll x)
{
    for (int  i = 32; i >= 0; i--) {
        if ((1 << i)&x)cerr << "1";
        else cerr << "0";
    }
    cerr << "\n";
}
bool cmp(const pair<int, int> &a,
         const pair<int, int> &b)
{
    return (a.second > b.second);
}

ll ncr(int n,int r){
	// (n-1)ck + (n-1)c(k-1) = nck;
   	ll ans = 1;
   	if(r > n-r)r = n-r;
   	for(ll i = 1;i<=r;i++){
   		ans*=(n-i+1), ans/=i;
   	}return ans;
}

ll pow(ll a, ll b) {
    ll res = 1;
    while (b > 0) {
        if (b & 1)res = (res * a) % mod;
        b >>= 1;
        a = (a * a) % mod;
    }
    return res;
}

void solve(){
	string s;cin >> s;
	if(count(all(s), 'a') == sz(s)){
		cout << "NO\n";
		return;
	}
	cout << "YES\n";
	// int ind;
	// int n = sz(s);
	string t = s + 'a';
	bool flag =0;
	for(int i = 0;i<sz(t)/2;i++){
		if(t[i] != t[sz(t)-i-1])flag = 1;
	}
	if(flag){
		cout << t<< endl;
	}
	else{
		cout << 'a';
		cout << s <<endl;
	}
	
}

int main() {
    init();
	// int tc = 1;
	// cout << "Case " << tc++ << ": ";
    int t;cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}
 
```