#include <bits/stdc++.h>
using namespace std;
void read (int &x) {
    char ch = getchar(); int f = 0; x = 0;
    while (!isdigit(ch)) { if (ch == '-') f = 1; ch = getchar(); }
    while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar();
    if (f) x = -x;
} const int N = 1e5 + 5;
int n, m, k, p[N]; char a[N][5], b[5], c[5];
int f (char *p) {
    return p[0] * 1000000 + p[1] * 10000 + p[2] * 100 + p[3];
}
struct qwq { int id, num; } u[N]; int uu[N];
bool cmp (qwq a, qwq b) { return a.num < b.num; }
vector<int> g[N]; int o[N];
void add (int u, int v) { g[u].push_back (v), ++o[v]; }
queue<int> q;
void work (int w) {
    for (int i = 0; i < (1 << k); ++i) {
        int tag = 0;
        for (int j = 0; j < k; ++j)
            if ((i >> j) & 1) c[j] = b[j]; else c[j] = '_';

        int cc = f (c);
        int t = lower_bound (uu + 1, uu + n + 1, cc) - uu;
        if (uu[t] == cc && u[t].id != w) {
            add (u[t].id, w);
            // printf ("%d ", u[t].id); for (int j = 0; j < k; ++j) putchar (c[j]); puts ("");
        }
    }
}
signed main() {
    read (n), read (m), read (k);
    for (int i = 1; i <= n; ++i) scanf ("%s", a[i]);
    for (int i = 1; i <= n; ++i) u[i].id = i, u[i].num = f (a[i]);
    sort (u + 1, u + n + 1, cmp);
    for (int i = 1; i <= n; ++i) uu[i] = u[i].num;
    for (int i = 1, w; i <= m; ++i) {
        scanf ("%s %d", b, &w), work (w);
        for (int j = 0; j < k; ++j)
            if (a[w][j] != '_' && a[w][j] != b[j]) { return puts ("NO"), 0; }
    }
    for (int i = 1; i <= n; ++i) if (!o[i]) q.push (i);
    int now = n;
    while (!q.empty()) {
        int u = q.front(); q.pop(); p[now--] = u;
        for (int v : g[u]) if (!(--o[v])) q.push (v);
    }
    if (now) { return puts ("NO"), 0; } puts ("YES");
    for (int i = 1; i <= n; ++i) printf ("%d ", p[i]); puts ("");
}
