import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int q = in.nextInt();
        String[] s = new String[q];
        for(int a0 = 0; a0 < q; a0++){
            s[a0] = in.next();
            
        }
        Hashtable<String, Integer> wordBase = new Hashtable<String, Integer>();
        wordBase = createBase("hackerrank");
        for(int i = 0; i< q; i++){
            compareWords(wordBase, s[i]);    
        }
        
        
    }
    public static void compareWords(Hashtable<String, Integer> base, String word){
        String[] wordArray = word.split("");
        String result = "YES";
        Hashtable<String, Integer> hashword = new Hashtable<String, Integer>();
        
        for(int i=1; i<wordArray.length; i++){
            if(base.containsKey(wordArray[i]) && hashword.containsKey(wordArray[i])){
                hashword.put(wordArray[i],hashword.get(wordArray[i])+1);
            }else if(base.containsKey(wordArray[i]) && !hashword.containsKey(wordArray[i])){
                hashword.put(wordArray[i], 1);
            }
        }
        if(hashword.size() == base.size()){
         for(Map.Entry<String, Integer> entry : hashword.entrySet()){
             if(entry.getValue() < base.get(entry.getKey())){
               result="NO";
                 break;
             }
             
         }   
        }else{
            result="NO";
        }
        System.out.println(result);
    }
    public static Hashtable<String, Integer> createBase(String word){
        Hashtable<String, Integer> hashword = new Hashtable<String, Integer>();
        String[] wordArray = word.split("");
        for(int i=1; i<wordArray.length; i++){
            if(hashword.containsKey(wordArray[i])){
                hashword.put(wordArray[i],hashword.get(wordArray[i])+1);
            }else{
                hashword.put(wordArray[i],1);
            }
        }
        return hashword;
    }
}