#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll inf = 0x3f3f3f3f3f3f3f3f;

vector<int> G[105];
int a[105], len[105], d[105][105]; 
int ch[105][2], fail[105], str[105], cnt;
int vec[105], id[105], tot;
bool ed[105];

void inst(int len)
{
	int p = 0;
	for (int i = 1; i <= len; i++)
	{
		int c = str[i];
		if (!ch[p][c]) ch[p][c] = ++cnt;
		p = ch[p][c];
	}
	ed[p] = 1;
}

void getfail()
{
	queue<int> q;
	if (ch[0][0]) q.push(ch[0][0]), fail[ch[0][0]] = 0;
	if (ch[0][1]) q.push(ch[0][1]), fail[ch[0][1]] = 0;
	while (q.size())
	{
		int u = q.front(); q.pop();
		ed[u] |= ed[fail[u]];
		for (int i = 0; i < 2; i++)
		{
			int v = ch[u][i], f = fail[u];
			if (!v)
			{
				ch[u][i] = ch[f][i];
				continue;
			}
			fail[v] = ch[f][i];
			q.push(v);
		}
	}
}

ll f[105][55][55], g[2][55];
bool inq[105];

bool update(int k)
{
	bool fl = false;
	for (int t = 1; t <= tot; t++)
	{
		memset(g, 0x3f, sizeof(g));
		bool p = 0;
		g[0][t] = 0;
		for (int i = 1; i <= len[k]; i++, p ^= 1)
		{
			memset(g[p ^ 1], 0x3f, sizeof(g[p ^ 1]));
			int b = d[k][i];
			for (int y = 1; y <= tot; y++)
				for (int x = 1; x <= tot; x++) g[p ^ 1][y] = min(g[p ^ 1][y], g[p][x] + f[b][x][y]);
		}
		for (int x = 1; x <= tot; x++)
			if (f[a[k]][t][x] > g[p][x])
			{
				f[a[k]][t][x] = g[p][x];
				fl = true;
			}
	}
	return fl;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int g, n, m;
	cin >> g >> n >> m;
	for (int i = 1, k; i <= n; i++)
	{
		cin >> a[i] >> k;
		len[i] = k;
		for (int j = 1; j <= k; j++)
		{
			int b;
			cin >> b;
			d[i][j] = b;
			G[b].emplace_back(i);
		}
	}
	
	for (int i = 0; i < g; i++)
	{
		sort(G[i].begin(), G[i].end());
		G[i].resize(unique(G[i].begin(), G[i].end()) - G[i].begin());
	}
	
	for (int i = 1; i <= m; i++)
	{
		int len;
		cin >> len;
		for (int j = 1; j <= len; j++) cin >> str[j];
		inst(len);
	}
	getfail();
	for (int i = 0; i <= cnt; i++)
		if (!ed[i]) vec[++tot] = i, id[i] = tot;
	
	queue<int> q;
	q.push(0), q.push(1);
	inq[0] = inq[1] = 1;
	memset(f, 0x3f, sizeof(f)); 
	for (int i = 1; i <= tot; i++)
		f[0][i][id[ch[vec[i]][0]]] = 1, f[1][i][id[ch[vec[i]][1]]] = 1;
	while (q.size())
	{
		int u = q.front(); q.pop();
		inq[u] = 0;
		for (int x : G[u])
			if (update(x) && !inq[a[x]])
			{
				inq[a[x]] = 1;
				q.push(a[x]);
			}
	}
	
	for (int i = 2; i < g; i++)
	{
		ll ans = inf;
		for (int x = 1; x <= tot; x++) ans = min(ans, f[i][1][x]);
		if (ans >= inf) cout << "YES\n";
		else cout << "NO " << ans << "\n";
	}
	return 0;
}