#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define pb push_back
#define se second
#define int long long 
int n, m, kk;
int vis[25], _n[25], _m[25];
char s[25][25], t[25][25], f[25][25][25];
int tot;
struct Do {
	int op, x, y;
	void print() {
		cout << op << " " << x << " " << y << "\n";
	}
	Do() {}
	Do(int a, int b, int c) { op = a, x = b, y = c; } 
} ans[400010];
void putback(char* c) {
	for (int i = 24; i >= 1; i--) c[i] = c[i - 1];
}
int cnt[257], tmp[257];
void move(int x1, int y1, int x2, int y2) {   // 移动 (x1, y1) -> (x2, y2) 
	while (x1 < x2) ans[++tot] = Do(-3, x1, y1), swap(t[x1][y1], t[x1 + 1][y1]), x1++;
	while (y1 > y2) ans[++tot] = Do(-2, x1, y1), swap(t[x1][y1], t[x1][y1 - 1]), y1--;
	while (y1 < y2) ans[++tot] = Do(-1, x1, y1), swap(t[x1][y1], t[x1][y1 + 1]), y1++;
	while (x1 > x2) ans[++tot] = Do(-4, x1, y1), swap(t[x1][y1], t[x1 - 1][y1]), x1--;
}
void put_(int x1, int y1, int x2, int y2) {   // put *
	for (int i = x1; i <= x2; i++)
		for (int j = y1; j <= y2; j++) t[i][j] = '*';
}
signed main() {
	cin >> n >> m >> kk;
	for (int i = 1; i <= n; i++) {
		cin >> s[i];
		putback(s[i]);
	}
	for (int i = 1; i <= n; i++) {
		cin >> t[i];
		putback(t[i]);
	}
	for (int i = 1; i <= kk; i++) {
		cin >> _n[i] >> _m[i];
		for (int j = 1; j <= _n[i]; j++) {
			cin >> f[i][j];
			putback(f[i][j]);
		} 
	}
	int yyc = 0;
	while (true) {
		bool flg = 1;
		for (int i = 1; i <= kk; i++)
			if (!vis[i]) flg = 0;
		if (flg) break;
		flg = 1;
		for (int i = 1; i <= kk; i++) {
			if (vis[i]) continue;
			memset(cnt, 0, sizeof cnt);
			for (int j = 1; j <= n; j++)
				for (int k = 1; k <= m; k++)
					cnt[t[j][k]]++;
			for (int j = 0; j <= 256; j++) tmp[j] = cnt[j];
			int ok = 0;
			for (int j = 1; j <= _n[i]; j++)
				for (int k = 1; k <= _m[i]; k++)
					if (tmp[f[i][j][k]]) ok++, tmp[f[i][j][k]]--;
			if (ok + cnt['*'] < _n[i] * _m[i] || !ok) continue;
			// 可以进行
			for (int j = 1; j <= _n[i]; j++)
				for (int k = 1; k <= _m[i]; k++) {
					char c = f[i][j][k];
					int x = 0, y = 0, _x = 0, _y = 0;
					for (int _i = 1; _i <= n; _i++)
						for (int _j = (_i < j ? _m[i] + 1 : (_i == j ? k : 1)); _j <= m; _j++) {
							if (t[_i][_j] == c) {
								x = _i, y = _j; break;
							}
							if (t[_i][_j] == '*') _x = _i, _y = _j;
						}
					if (x && y) {
						move(x, y, j, k);
					} else {
						move(_x, _y, j, k);
					}
				}
			ans[++tot] = Do(i, 1, 1); yyc++;
			put_(1, 1, _n[i], _m[i]);
			while (true) {
				// 恢复 
				memset(cnt, 0, sizeof cnt);
				for (int j = 1; j <= n; j++)
					for (int k = 1; k <= m; k++)
						cnt[t[j][k]]++;
				for (int j = 0; j <= 256; j++) tmp[j] = cnt[j];
				int ok = 0;
				for (int j = 1; j <= _n[i]; j++)
					for (int k = 1; k <= _m[i]; k++)
						if (tmp[f[i][j][k]]) ok++, tmp[f[i][j][k]]--;
				if (ok + cnt['*'] < _n[i] * _m[i] || !ok) break;
				for (int j = 1; j <= _n[i]; j++)
					for (int k = 1; k <= _m[i]; k++) {
						char c = f[i][j][k];
						int x = 0, y = 0;
						for (int _i = 1; _i <= n; _i++)
							for (int _j = 1; _j <= m; _j++) {
								if (t[_i][_j] == c) {
									x = _i, y = _j; break;
								}
							}
						if (x && y) {
							move(x, y, j, k);
							ans[++tot] = Do(i, 1, 1); yyc++; 
							put_(1, 1, _n[i], _m[i]); break;
						}
					}
			} 
			vis[i] = 1;
			flg = 0;
		}
		if (flg) break;
	}
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++) {
			int x = 0, y = 0, _x = 0, _y = 0;
			for (int _i = i; _i <= n; _i++)
				for (int _j = (_i == i ? j : 1); _j <= m; _j++) {
					if (s[i][j] == t[_i][_j]) {
						x = _i, y = _j;
						continue;
					}
					if (t[_i][_j] == '*') {
						_x = _i, _y = _j;
						continue;
					}
				}
			if (x && y) {
				move(x, y, i, j);
			} else if (_x && _y) {
				move(_x, _y, i, j);	
			} else {
				cout << "-1\n";
//				if (n == 2 && m == 2 && kk == 1) return 0;
				return 0;
			}
		}
	if (tot > 4e5) return 1;
	if (yyc > 400) return 1; 
	cout << tot << "\n";
	for (int i = tot; i >= 1; i--) ans[i].print();
	return 0;
}