#include <bits/stdc++.h>
using namespace std;
struct node
{
char data;
node *left, *right;
};
int flag;
char _string[15];
//void Inorder(node *root);
void Insert(node *(&root), char x);
void cmpare(node *root1, node *root2);
node *creat(int lenth, char _string[]);
int main()
{
node *root1, *root2;
int n;
while(cin >> n, n)
{
scanf("%s", _string);
root1 = creat(strlen(_string), _string);
while(n--)
{
flag = 1;
scanf("%s", _string);
root2 = creat(strlen(_string), _string);
cmpare(root1, root2);
if(flag)
{
cout << "YES" << endl;
}
else
{
cout << "NO" << endl;
}
}
}
return 0;
}
node *creat(int lenth, char _string[])
{
node *root = NULL;
int i = 0;
while(i < lenth)
{
Insert(root, _string[i]);
i++;
}
return root;
}
void Insert(node *(&root), char x)
{
if(!root)
{
root = new node;
root -> data = x;
root -> left = NULL;
root -> right = NULL;
}
else if(x < root -> data)
{
Insert(root -> left, x);
}
else
{
Insert(root -> right, x);
}
}
/*void Inorder(node *root)
{
if(root)
{
Inorder(root -> left);
cout << root -> data;
Inorder(root -> right);
}
}
*/
void cmpare(node *root1, node *root2)
{
if(root1==NULL &&root2==NULL)
{
return;
}
else if(root1==NULL || root2==NULL)
{
flag=0;
return;
}
else if(root1->data!=root2->data)
{
flag=0;
return;
}
else
{
cmpare(root1->left, root2->left);
cmpare(root1->right, root2->right);
}
}