// 
// Memory Limit: 256 MB
// Time Limit: 1000 ms

// 
// Memory Limit: 256 MB
// Time Limit: 2000 ms

#include <bits/stdc++.h>
#define ll long long 
#define mp make_pair
#define pb push_back
#define ve vector
#define fi first
#define se second
#define sz(s) (int)s.size()
#define nl "\n"
//
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rop(i, n) for(int i = 0; i < n; i++)
#define r1p(i, n) for(int i = 1; i <= n; i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rev(x) reverse(all(x))
#define srt(x) sort(all(x))
//
#define yep cout << "YES" << nl
#define nope cout << "NO" << nl
#define retr return
//
using namespace std;
typedef ve<int> vi;
typedef ve<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
//
const int MOD = 1e9;
const int mxN = 1e5 + 5;
void solve() {
	string s;
	cin >> s;
	int n = sz(s), idx = -1;
	bool ok = true;
	for(int i = 0; i < n; i++ ) {
		if(s[i] != 'a') {
			ok = false;
			if(idx == -1)
				idx = i;
		}
	}
	if(ok)
		nope;
	else {
		cout << "YES" << nl;
		for(int i = 0; i < n; i++) {
			cout << s[i];
			if(i == n - idx - 1)
				cout << 'a';
		}
		cout << nl;
	}
}
void cf() {int tt;cin >> tt;while(tt--) {solve();}}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//
	cf();
}

