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 JAVA):

Solution:
//package codeforces;
import java.util.*;
import java.lang.*;
import java.io.*;
public class A_712 {
	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}

		int[] readArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}
	}

	static void ruffle_sort(int[] a) {
		//shandom_ruffle
		Random r = new Random();
		int n = a.length;
		for (int i = 0; i < n; i++) {
			int oi = r.nextInt(n);
			int temp = a[i];
			a[i] = a[oi];
			a[oi] = temp;
		}

		//sort
		Arrays.sort(a);
	}

	static int hcf(int a, int b) {
		if (b == 0)
			return a;
		return hcf(b, a % b);
	}

	static int pow(int a, int b) {
		int ans = 1;
		while (b > 0) {
			if ((b & 1) != 0)
				ans *= a;

			a = a * a;
			b = b >> 1;
		}
		return ans;
	}

	static void prime(List<Integer> prime, int n) {

		boolean arr[] = new boolean[n + 1];
		Arrays.fill(arr, true);
		arr[0] = arr[1] = false;
		for (int i = 2; i * i <= n; i++) {
			if (arr[i] == true) {
				//prime.add(i);
				for (int j = i * i; j < arr.length; j += i)
					arr[j] = false;
			}
		}
		for (int i = 0; i < arr.length; i++) {
			if (arr[i] == true)
				prime.add(i);
		}

	}

	public static void main(String[] args) throws java.lang.Exception {
		try {
			FastReader sc = new FastReader();
			PrintWriter out = new PrintWriter(System.out);
			int t = sc.nextInt();
			while (t-- > 0) {
				String s=sc.next();
				char ch[]=s.toCharArray();
				int n = ch.length;
				String s1="",s2="";
				s1+=s+'a';
				s2+='a'+s;
				int c=0;
				for(int i=0;i<s.length();i++)
				{
					if(s.charAt(i)=='a')
						c++;
					
				}
				if(c==n)
				{
					System.out.println("NO");
				}
				else if(!pallin(s1))
					
				{
					System.out.println("YES");
					System.out.println(s1);
				}
				else if(!pallin(s2))
				{
					System.out.println("YES");
					System.out.println(s2);
				}
					
				}
			
			out.close();
		} catch (Exception e) {
		} finally {
			return;
		}
	}

public static boolean pallin(String s2) {
		char ch[]=s2.toCharArray();
		int l=0,r=ch.length-1;
		while(l<=r)
		{
			if(ch[l]!=ch[r])
				return false;
			l++;
			r--;
		}
		return true;
	}


}