package mockExamWordAnagrams;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;
public class Main {
    static boolean check(String[] input1, String[] input2){
        boolean flag = false;
        int counter = 0;
        int breaker = input1.length;
        for (int i = 0; i < input1.length; i++) {
            if (input1[i].equals(input2[i])){
                counter++;
            }
        }
        if (counter == breaker){
            flag = true;
        }
        return flag;
    }
    static String[] sortLetters(String input) {
        String[] inputArray = input.split("");
        List<String> wordList = Arrays.stream(inputArray).sorted().collect(Collectors.toList());
        String[] returnArray = new String[wordList.size()];
        for (int i = 0; i < wordList.size(); i++) {
            returnArray[i] = wordList.get(i);
        }
        return returnArray;
    }
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String word = scanner.nextLine().toLowerCase();
        String modelWord = word;
        String[] modelArray = sortLetters(word);
        int wordCount = Integer.parseInt(scanner.nextLine());
        for (int i = 0; i < wordCount; i++) {
            word = scanner.nextLine();
            if (modelWord.equals(word)) {
                System.out.print("Yes");
            } else {
                String[] testArray = sortLetters(word);
                if (modelArray.length == testArray.length) {
                    boolean go = check(modelArray, testArray);
                    if (go) {
                        System.out.print("Yes");
                    } else {
                        System.out.print("No");
                    }
                } else {
                    System.out.print("No");
                }
            }
            if (i < wordCount - 1) {
                System.out.println();
            }
        }
    }
}