#include <bits/stdc++.h>

#define x first
#define y second
#define mp make_pair

using namespace std;
typedef pair<int,int> PII;
const int N = 65, M = 4e5 + 10, S = 'z' + 1, C = 62;

int a[N][N][N], b[N][N], cntb[N], c[N][N][N], cntc[N][N], top, v[N], n, m, k;
int id[S], idx;
PII it[N], sz[N];
char str[N];

struct Op{
    int k, x, y;
}stk[M];

void make_move(int& x, int& y, int dx, int dy)
{
    int nx = x + dx, ny = y + dy;
    int nowc = b[x][y], nxtc = b[nx][ny];
    a[nowc][x][y] = 0, a[nowc][nx][ny] = 1;
    a[nxtc][nx][ny] = 0, a[nxtc][x][y] = 1;
    swap(b[x][y], b[nx][ny]);
    x = nx, y = ny;
}

void f(PII st, PII ed)
{
    int x1 = st.x, y1 = st.y, x2 = ed.x, y2 = ed.y;
    if(y1 >= y2)
    {
        while(x1 < x2)
        {
            stk[++top] = Op({-3, x1, y1});
            make_move(x1, y1, 1, 0);
        }
        while(x1 > x2)
        {
            stk[++top] = Op({-4, x1, y1});
            make_move(x1, y1, -1, 0);
        }
        while(y1 > y2)
        {
            stk[++top] = Op({-2, x1, y1});
            make_move(x1, y1, 0, -1);
        }
    }
    else
    {
        while(y1 > y2)
        {
            stk[++top] = Op({-2, x1, y1});
            make_move(x1, y1, 0, -1);
        }
        while(y1 < y2)
        {
            stk[++top] = Op({-1, x1, y1});
            make_move(x1, y1, 0, 1);
        }
        while(x1 > x2)
        {
            stk[++top] = Op({-4, x1, y1});
            make_move(x1, y1, -1, 0);
        }
    }
}

PII getnxt(int c)
{
    int i = it[c].x, j = it[c].y;
    while(1)
    {
        j++;
        if(j > m) i++, j = 1;
        if(i > n) return it[c] = mp(i, j);
        if(a[c][i][j]) break;
    }
    it[c] = mp(i, j);
    return it[c];
}

void input(int idc)
{
    int n = sz[idc].x, m = sz[idc].y;
    for(int i = 1; i <= n; i++)
    {
        scanf("%s", str + 1);
        for(int j = 1; j <= m; j++)
        {
            c[idc][i][j] = id[str[j]];
            cntc[idc][c[idc][i][j]]++;
        }
    }
}

int valid(int idc)
{
    int cnt0 = cntb[0];
    for(int i = 1; i <= C; i++)
    {
        if(cntb[i] < cntc[idc][i])
        {
            if(cntb[i] + cnt0 < cntc[idc][i])
            {
                return 0;
            }
            cnt0 -= cntc[idc][i] - cntb[i];
        }
    }
    return 1;
}

void output()
{
    printf("%d\n", top);
    while(top)
    {
        printf("%d %d %d\n", stk[top].k, stk[top].x, stk[top].y);
        top--;
    }
}

int ok()
{
    int cnt[N]; memset(cnt, 0, sizeof(cnt));
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            cnt[b[i][j]]++;
        }
    }
    for(int i = 0; i <= C; i++) if(cnt[i] != cntb[i]) return 0;
    return 1;
}

int main()
{
    //freopen("data.in", "r", stdin);
    for(int i = 'A'; i <= 'Z'; i++) id[i] = ++idx;
    for(int i = 'a'; i <= 'z'; i++) id[i] = ++idx;
    for(int i = '0'; i <= '9'; i++) id[i] = ++idx;
    scanf("%d%d%d", &n, &m, &k);
    sz[0] = mp(n, m);
    input(0);
    for(int i = 1; i <= n; i++)
    {
        scanf("%s", str + 1);
        for(int j = 1; j <= m; j++)
        {
            b[i][j] = id[str[j]];
            a[b[i][j]][i][j] = 1;
            cntb[b[i][j]]++;
        }
    }
    for(int i = 1; i <= k; i++)
    {
        scanf("%d%d", &sz[i].x, &sz[i].y);
        input(i);
    }

    while(1)
    {
        if(cntb[0] == n * m)
        {
            output();
            return 0;
        }
        int flag = 0;
        for(int p = 0; p <= k; p++)
        {
            if(v[p]) continue;
            if(valid(p))
            {
                for(int i = 0; i <= C; i++) it[i] = mp(1, 0);
                int n1 = sz[p].x, m1 = sz[p].y;
                for(int i = 1; i <= n1; i++)
                {
                    for(int j = 1; j <= m1; j++)
                    {
                        PII nxt = getnxt(c[p][i][j]);
                        if(nxt.x > n) nxt = getnxt(0);
                        f(nxt, mp(i, j));
                    }
                }



                if(p) stk[++top] = Op({p, 1, 1});
                for(int i = 1; i <= n1; i++)
                {
                    for(int j = 1; j <= m1; j++)
                    {
                        int nowc = b[i][j];
                        a[nowc][i][j] = 0; a[0][i][j] = 1;
                        b[i][j] = 0;
                        cntb[nowc]--, cntb[0]++;
                    }
                }
                for(int i = 0; i <= C; i++) it[i] = mp(1, 0);

                for(int i = 1; i <= n1; i++)
                {
                    for(int j = 1; j <= m1; j++)
                    {
                        int cc = c[p][i][j];
                        while(cntb[cc])
                        {
                            f(getnxt(cc), mp(i, j));
                            stk[++top] = Op({p, 1, 1});
                            cntb[cc]--, cntb[0]++;
                            b[i][j] = 0; a[cc][i][j] = 0, a[0][i][j] = 1;
                        }
                    }
                }

                flag = v[p] = 1;
                break;
            }
        }
        if(!flag)
        {
            puts("-1");
            return 0;
        }
    }
    return 0;
}