A string s of length n (1 ≤ n ≤ 26) is called alphabetical if it can be obtained using the following algorithm:

  * first, write an empty string to s (i.e. perform the assignment s := ""); 
  * then perform the next step n times; 
  * at the i-th step take i-th lowercase letter of the Latin alphabet and write it either to the left of the string s or to the right of the string s (i.e. perform the assignment s := c+s or s := s+c, where c is the i-th letter of the Latin alphabet). 



In other words, iterate over the n first letters of the Latin alphabet starting from 'a' and etc. Each time we prepend a letter to the left of the string s or append a letter to the right of the string s. Strings that can be obtained in that way are alphabetical.

For example, the following strings are alphabetical: "a", "ba", "ab", "bac" and "ihfcbadeg". The following strings are not alphabetical: "z", "aa", "ca", "acb", "xyz" and "ddcba".

From the given string, determine if it is alphabetical.

Input

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

Each test case is written on a separate line that contains one string s. String s consists of lowercase letters of the Latin alphabet and has a length between 1 and 26, inclusive.

Output

Output t lines, each of them must contain the answer to the corresponding test case. Output YES if the given string s is alphabetical and NO otherwise.

You can output YES and NO in any case (for example, strings yEs, yes, Yes and YES will be recognized as a positive answer).

Example

Input


11
a
ba
ab
bac
ihfcbadeg
z
aa
ca
acb
xyz
ddcba


Output


YES
YES
YES
YES
YES
NO
NO
NO
NO
NO
NO

Note

The example contains test cases from the main part of the condition.
    import java.io.BufferedReader;
    import java.io.IOException;
    import java.io.InputStreamReader;
    import java.util.Scanner;
    import java.util.StringTokenizer;
    import java.lang.Math;
     
    public class som {
    	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;
    		}
    	}
     
    	public static void main(String[] args) throws Exception
    	{
    		FastReader sc = new FastReader();
    		int i=sc.nextInt();
    		for(int n=0;n<i;n++)
    		{
    			String st=sc.next();
    		st="-"+st+"-";
    		solve(st);
    		}
    	}
    	public static void solve(String str)
    	{
    		FastReader sc = new FastReader();
    		int idx=-1;
    		for(int i=0;i<str.length();i++)
    		{
    			char a=str.charAt(i);
    			if(a=='a')
    			{
    				idx=i;
    			}
    		}
    		if(idx==-1)
    		{
    			System.out.println("NO");
    			return;
    		}
    		char cur='b';
    		int k=idx-1;
    		int j=idx+1;
    		while(k>=0 || j<str.length()-1)
    		{
    			char c1=str.charAt(k);
    			char c2=str.charAt(j);
    			if(c1==cur)
    			{
    				k--;
    				cur++;
    			}
    			else if(c2==cur)
    			{
    				j++;
    				cur++;
    			}
    			else
    			{
    				break;
    			}
    		}
    		if(k==0 && j==str.length()-1)
    		{
    			System.out.println("Yes");
    		}
    		else
    			System.out.println("NO");
    	}
     
    }

