Polycarp wants to assemble his own keyboard. Layouts with multiple rows are too complicated for him — his keyboard will consist of only one row, where all 26 lowercase Latin letters will be arranged in some order.

Polycarp uses the same password s on all websites where he is registered (it is bad, but he doesn't care). He wants to assemble a keyboard that will allow to type this password very easily. He doesn't like to move his fingers while typing the password, so, for each pair of adjacent characters in s, they should be adjacent on the keyboard. For example, if the password is abacaba, then the layout cabdefghi... is perfect, since characters a and c are adjacent on the keyboard, and a and b are adjacent on the keyboard. It is guaranteed that there are no two adjacent equal characters in s, so, for example, the password cannot be password (two characters s are adjacent).

Can you help Polycarp with choosing the perfect layout of the keyboard, if it is possible?

Input

The first line contains one integer T (1 ≤ T ≤ 1000) — the number of test cases.

Then T lines follow, each containing one string s (1 ≤ |s| ≤ 200) representing the test case. s consists of lowercase Latin letters only. There are no two adjacent equal characters in s.

Output

For each test case, do the following:

  * if it is impossible to assemble a perfect keyboard, print NO (in upper case, it matters in this problem); 
  * otherwise, print YES (in upper case), and then a string consisting of 26 lowercase Latin letters — the perfect layout. Each Latin letter should appear in this string exactly once. If there are multiple answers, print any of them. 

Example

Input


5
ababa
codedoca
abcda
zxzytyz
abcdefghijklmnopqrstuvwxyza


Output


YES
bacdefghijklmnopqrstuvwxyz
YES
edocabfghijklmnpqrstuvwxyz
NO
YES
xzytabcdefghijklmnopqrsuvw
NO
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.math.RoundingMode;
import java.security.KeyStore.Entry;
import java.text.DecimalFormat;
import java.util.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
import javax.net.ssl.SSLContext;

public class Main
{ 
   static long mod=(long)(1e+9 + 7);
   static int[] sieve;
   static ArrayList<Integer> primes;
   static long min=Long.MAX_VALUE;
   static int cycle=0;
   
   public static void dfs(int par,int start,ArrayList<Integer>[] graph,int[] visited,int[] stack,ArrayList<Integer> ans)
   {
	   if(stack[start]==1) cycle=1;
	   
	   if(visited[start]==1) return;
	   
	   visited[start]=1;
	   stack[start]=1;
	   
	   for(int i=0;i<graph[start].size();i++)
		   {
			   if(graph[start].get(i)!=par)
			      dfs(start,graph[start].get(i),graph,visited,stack,ans);
		   }
	   ans.add(start);
	   stack[start]=0;
   }
   
   public static void main(String[] args) throws java.lang.Exception
   {	  	
	     fast s = new fast();
	     PrintWriter out=new PrintWriter(System.out);
	     
	     int t=s.nextInt();
	     
	     while(t>0)
	    	 {
	    		 cycle=0;
	    		 String str=s.nextLine();
	    		 HashSet<Character> f=new HashSet<Character>();
	    		 for(int i=0;i<str.length();i++) f.add(str.charAt(i));
	    		 
	    		 int unique=f.size();
	    		 ArrayList<Integer>[] graph=new ArrayList[27];
	    		 
	    		 HashSet<Integer>[] hm=new HashSet[27];
	    		 
	    		 int degree[]=new int[26];
	    		 
	    		 for(int i=0;i<graph.length;i++)
	    			 {
	    				 graph[i]=new ArrayList<Integer>();
	    				 hm[i]=new HashSet<Integer>();
	    			 }
	    		 
	    		 for(int i=1;i<str.length();i++)
	    			 {
	    				 int u=str.charAt(i-1)-'a';
	    				 int v=str.charAt(i)-'a';
	    				 
	    				 if(!hm[u].contains(v))
	    					 {
	    						 graph[u].add(v);
	    						 hm[u].add(v);
	    						 degree[u]++;
	    					 }
	    				 
	    				 if(!hm[v].contains(u))
	    					 {
	    						 graph[v].add(u);
	    						 hm[v].add(u);
	    						 degree[v]++;
	    					 }
	    			 }
	    		 
	    		 int visited[]=new int[26];
	    		 int stack[]=new int[26];
	    		 ArrayList<Integer> ans=new ArrayList<Integer>();
	    		 
	    		 int flag=1;
	    		 HashSet<Integer> include=new HashSet<Integer>();

	    		 int one=0;int two=0;
	    		 
                 for(int i=0;i<degree.length;i++) 
                	 {
                		 if(degree[i]==1) one++;
                		 if(degree[i]==2) two++;
                		 if(degree[i]>=3) flag=0;
                	 }
                 
	    		 for(int i=0;i<26 && flag==1;i++)
	    			 {
	    				 if(visited[i]==0 && graph[i].size()>0 && degree[i]<=1)
	    					 {
	    						 dfs(-1,i,graph,visited,stack,ans);
	    						 if(cycle==1)
	    							 {
	    								 flag=0;
	    								 break;
	    							 }
	    					 }
	    			 }
	    		 
	    		 if(str.length()!=1 && (flag==0 || ans.size()<unique))
	    			 System.out.print("NO");
	    		 else
	    			 {
	    				 System.out.println("YES");
	    				 for(int i=0;i<ans.size();i++) include.add(ans.get(i));
	    				 ArrayList<Character> fans=new ArrayList<Character>();
	    				 for(int i=0;i<ans.size();i++) fans.add((char) ('a'+ans.get(i)));
	    				 for(int i=0;i<26;i++) if(!include.contains(i)) fans.add((char) ('a'+i));
	    				 for(int i=0;i<fans.size();i++) System.out.print(fans.get(i));
	    			 }
	    		 System.out.println();
                 t--;
	    	 }
   }
  
 
 
static class fast {   
	    private InputStream i;
		private byte[]  buf = new byte[1024];
		private int curChar;
		
		private int numChars;
		
		//Return floor log2n
		public static long log2(long bits) // returns 0 for bits=0
			{
			    int log = 0;
			    if( ( bits & 0xffff0000 ) != 0 ) { bits >>>= 16; log = 16; }
			    if( bits >= 256 ) { bits >>>= 8; log += 8; }
			    if( bits >= 16  ) { bits >>>= 4; log += 4; }
			    if( bits >= 4   ) { bits >>>= 2; log += 2; }
			    return log + ( bits >>> 1 );
			}
		
		public static boolean next_permutation(int a[])
		   {
			   int i=0,j=0;int index=-1;	   
			   int n=a.length;
			   
			   for(i=0;i<n-1;i++)
				   if(a[i]<a[i+1]) index=i;
			   
			   if(index==-1) return false;
			   i=index;
 
			  
			   for(j=i+1;j<n && a[i]<a[j];j++);
 
			   int temp=a[i];
			   a[i]=a[j-1];
			   a[j-1]=temp;
			   	   
			   for(int p=i+1,q=n-1;p<q;p++,q--)
			   {
				   temp=a[p];
				   a[p]=a[q];
				   a[q]=temp;
			   }
			   
			   return true;
		   }
		   
		   
		public static void division(char ch[],int divisor)
		   {
			   int div=Character.getNumericValue(ch[0]); int mul=10;int remainder=0;
			   StringBuilder quotient=new StringBuilder("");
			   for(int i=1;i<ch.length;i++)
			   {
				   div=div*mul+Character.getNumericValue(ch[i]);	
				   if(div<divisor) {quotient.append("0");continue;}
				   quotient.append(div/divisor);
				   div=div%divisor;mul=10;
				   
			   } 
			   remainder=div;
			   while(quotient.charAt(0)=='0')quotient.deleteCharAt(0);	   
			   System.out.println(quotient+" "+remainder);	  
		   }
		
		public static void sieve(int size)
		{
			sieve=new int[size+1];
			
			primes=new ArrayList<Integer>();
			
			sieve[1]=1;
			
			for(int i=2;i*i<=size;i++)
			{
				if(sieve[i]==0)
				 {
					for(int j=i*i;j<size;j+=i) {sieve[j]=1;}
				 }
			}
			
			for(int i=2;i<=size;i++)
			{
				if(sieve[i]==0) primes.add(i);
			}
		}
		
		public static long pow(long n, long b, long MOD)
		   {
		       long x=1;long y=n; 
		       while(b > 0)
		       {
		           if(b%2 == 1)
		           {
		               x=x*y;
		               if(x>MOD) x=x%(MOD);
		           }
		           y = y*y;
		           if(y>MOD) y=y%(MOD); 
		           b >>= 1;
		       }
		       return x;
		   }
 
 
		public static long mod_inv(long n,long mod)
		{
			return pow(n,mod-2,mod);
		}
		
		//Returns index of highest number less than or equal to key
		 public static int upper(long[] a,int length,long key)
		 {
			    int low = 0;
		        int high = length-1;
		        int ans=-1;
		        
		        while (low <= high) {
		            int mid = (low + high) / 2;
		            if (key >= a[mid]) {
		                ans=mid;
		            	low = mid+1;
		            } else if(a[mid]>key){
		                high = mid - 1;
		            }
		        }
		        return ans;
		}
		
		//Returns index of least number greater than or equal to key
		 public static int lower(long[] a,int length,long key)
		 {
			    int low = 0;
		        int high = length-1;
		        int ans=-1;
		        
		        while (low <= high) {
		            int mid = (low + high) / 2;
		            if (key<=a[mid]) {
		                ans=mid;
		            	high = mid-1;
		            }
		            else{
		            		low=mid+1;
		            	}
		        }
		        return ans;
		} 
		   
		public long gcd(long r,long ans)
		{
			if(r==0) return ans;
			return gcd(ans%r,r);
		}
		public fast() {
			this(System.in);
		}
		public fast(InputStream is) {
			i = is;
		}
		public int read() {
			if (numChars == -1)
				throw new InputMismatchException();
			if (curChar >= numChars) {
				curChar = 0;
				try {
					numChars = i.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (numChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}
		public String nextLine() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndOfLine(c));
			return res.toString();
		}
		public String nextString() {
     		int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}
		public long nextLong() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
		public int nextInt() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
		public boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}
		public boolean isEndOfLine(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}
 
	}	
}