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.
/******************************************************************************

                            Online Java Compiler.
                Code, Compile, Run and Debug java program online.
Write your code in this editor and press "Run" button to execute it.

*******************************************************************************/
import java.util.*;
public class Main
{
	public static void main(String[] args) {
		Scanner sc= new Scanner(System.in);
	    ArrayList<Integer> list=new ArrayList<Integer>();
	    ArrayList<Long> list1=new ArrayList<Long>();
	    HashMap<Long,Long> map=new HashMap<Long,Long>();
	    int arr[]=new int[10000007];
	    long t;
	    t=sc.nextLong();
	    while (t>0)
	    {
	    String s;
	    s=sc.next();
	    int i,j,k,x,y,z,n,f,ff;
	    k=0;
	    n=s.length();
	    //System.out.println(n);
	    for (i=0;i<27;i++)
	    {
	        list.add((int)(-1));
	    }
	    for (i=0;i<(n);i++)
	    {
	        x=(int)s.charAt(i)-97;
	        y=list.get((int)x);
	        if (y!=-1)
	        {
	            k=1;
	            break;
	        }
	        list.set((int)x,(int)i);
	    }
	    y=list.get(1);
	    x=list.get(0);
	    for (i=1;i<27;i++)
	    {
	        ff=list.get(i);
	        if (ff==-1)
	        {
	            //System.out.println(i);
	            if (i==n)
	            {
	                k=0;
	            }
	            else
	            {
	                k=1;
	            }
	            break;
	        }
	        if (i==1)
	        {

	            if (Math.abs(x-y)!=1)
	            {
	                k=1;
	                break;
	            }
	            else
	            {
	                if (x>y)
	                {
	                    f=x;
	                    x=y;
	                    y=f;
	                }
	            }
	        }
	        else
	        {
	            z=list.get((int)i);
	            if ((x-z)!=1 && (z-y)!=1)
	            {
	                k=1;
	                break;
	            }
	            else
	            {
	                if (z<x)
	                {
	                    x=z;
	                }
	                else
	                {
	                    y=z;
	                }
	            }
	        }
	    }
	    j=list.get(0);
	    if (j==-1)
	    {
	        k=1;
	    }
	    if (k==1)
	    {
	        System.out.println("no");
	    }
	    else
	    {
	        System.out.println("yes");
	    }
	    t--;
	    list.clear();
	    }
	}
}