#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
const int maxn2 = 1e5+10;
const int inf = 0x3f3f3f3f-1;
bool check(int i,int d){
    while(i){
        if(i%10==d){
            return true;
        }
        i/=10;
    }
    return false;
}
typedef long long ll;
int ans[maxn],deg[maxn];
vector<int>g[maxn];
int n,m,k;
bool topsort(){
    queue<int>q;
    for(int i=1;i<=n;i++)
    {
        if(deg[i]==0) q.push(i);
    }
    int count = 0;
    while(!q.empty()){
        int t = q.front();
        q.pop();
        ans[++count] = t;
        for(auto id:g[t]){
            deg[id]--;
            if(deg[id]==0) q.push(id);
        }
    }
    if(count!=n) return false;
    return true;
}
int main(){
    bool ok =  true;
    cin>>n>>m>>k; 
    vector<string>p(n+5);
    map<string,int>mp;
    for(int i=1;i<=n;i++){
        cin>>p[i];
        mp[p[i]] = i;
    }
    for(int i=1;i<=m;i++){
        string s;
        int mt;
        cin>>s>>mt;
        vector<int>temp;
        string stemp = s;
        for(int j=0;j<(1<<k);j++){
            int cnt = 0 ;
            int flag = j;
            while(flag){
                if(flag&1) s[cnt] = ‘_‘;
                cnt++;
                flag>>=1;
            }
            if(mp[s]!=0){
                temp.push_back(mp[s]);
            }
//            cout <<s<<endl;
            s=stemp;
        }
        if(!count(temp.begin(),temp.end(),mt)) {
            ok = false;
        }
        for(auto id:temp){
            if(id!=mt){
                g[mt].push_back(id);
                deg[id]++;
            }
        }
    }
    if(!ok||!topsort()){
        cout<<"NO"<<endl;
        return 0;
    }
    cout<<"YES"<<endl;
    for(int i=1;i<=n;i++) cout<<ans[i]<<" ";
    cout<<endl; 
    return 0;
}