func_code_string: #include<bits/stdc++.h>      using namespace std;      using ll = long long int;   using vi = vector<int>;   #define f(n) for(int i = 0; i < n; i++)   #define fj(n) for(int j = 0; j < n; j++)   #define fk(n) for(int k = 0; k < n; k++)   #define ci(n) cin >> n;   #define ic(n) int n; cin >> n;   #define lc(n) int n; cin >> n;   #define all(a) a.begin(), a.end()   #define pri(a, n) for(int i = 0; i < n; i++) cout << a[i] <<    ; cout <<   n ;   #define sc(a, n) int a[n] = {0}; for(int i = 0; i < n; i++) cin >> a[i];   #define scl(a, n) ll a[n] = {0}; for(int i = 0; i < n; i++) cin >> a[i];   #define pb push_back   #define eb emplace_back   #define pii pair<int, int>   #define ft first   //#define int long long   const int inf = 1e9, maxn = 2e5, mod = 1e9 + 7;   vector<int> tps;   int used[maxn] = {0}, cols[maxn] = {0};      void DFS(vector<int> g[], int v)   {       used[v] = 1;       for(int u : g[v])       {           if(!used[u]) DFS(g, u);       }       tps.push_back(v);   }      void DFS2(vector<int> g[], int v, int col)   {       cols[v] = col;       for(int u : g[v])       {           if(cols[u] == 0) DFS2(g, u, col);       }   }         signed main()   {       ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);       int n, m, k;       cin >> n >> m >> k;       string t[n], s[m];       int mt[m];       f(n) cin >> t[i];       f(m) cin >> s[i] >> mt[i];       map<string, int> mp;       f(n) mp[t[i]] = i + 1;       vector<int> g[n], ag[n];       f(m) {           vector<int> ls;           string cs = s[i];           fj(1 << k) {               cs = s[i];               for(int id = 0; id < k; id++) {                   if((j >> id) & 1) cs[id] =  _ ;               }               if(mp[cs]) ls.pb(mp[cs] - 1);           }           if(find(all(ls), mt[i] - 1) == ls.end()) {               cout <<  NO ;               return 0;           }           for(int u : ls) {               if(u != mt[i] - 1) {                   g[mt[i] - 1].pb(u);                   ag[u].pb(mt[i] - 1);               }           }       }       int id = 0;       while(id < n)       {           DFS(g, id);           while(id < n && used[id] == 1) id++;       }       reverse(begin(tps), end(tps));       id = 0;       int col = 1;       while(id < n)       {           DFS2(ag, tps[id], col);           col++;           while(id < n && cols[tps[id]] > 0) id++;       }       //pri(cols, n)       if(col == n + 1) {           cout <<  YES n ;           f(n) cout << tps[i] + 1 <<    ;       } else {           cout <<  NO n ;          }   }   