二叉搜索树//二叉搜索树

#include <iostream>

void initial(int a[], int n)
{
    for(int i = 0; i < n; i++)
        a[i] = -1;
}

void insert(int a[], int x)
{
    int pos = 1;
    while(a[pos] != -1)
    {
        if(x < a[pos])
            pos = 2*pos;
        else 
            pos = 2*pos+1;
    }
    a[pos] = x;
}

bool isequal(int a[], int b[], int n)
{
    for(int i = 0; i < n; i++)
    {
        if(a[i] != b[i])
            return false;
    }
    return true;
}

int main()
{
    using namespace std;
    int n;
    int N = 1000;
    int tree[N];
    int test[N];
    while(cin >> n && n != 0)
    {
        string str;
        cin >> str;
        initial(tree,N);
        for(int i = 0; i < str.length(); i++)
            insert(tree,str[i]-‘0‘);
        while(n--)
        {
            cin >> str;
            initial(test,N);
            for(int i = 0; i < str.length(); i++)
                insert(test,str[i]-‘0‘);
            bool ans = isequal(tree,test,N);
            if(ans)
            printf("YES\n");
            else
            printf("NO\n");    
        }
    }
    return 0;
}