#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) fprintf(stderr, ##__VA_ARGS__)
#else
#define endl "\n"
#define debug(...) void(0)
#endif
using LL = long long;
vector<tuple<int, int, int>> fans;
int loc[30][30], tim;
struct matrix {
  int n, m;
  vector<char> a;
  matrix() = default;
  matrix(int n, int m) : n(n), m(m), a(n * m) {
    for (int i = 0; i < n * m; i++) cin >> a[i];
  }
  char* operator[](int i) { return a.data() + i * m; }
  valarray<int> count() {
    valarray<int> buc(128);
    for (int i = 0; i < n * m; i++) if (a[i] != '*') buc[(int)a[i]] += 1;
    return buc;
  }
  void moveone(char ch, int tx, int ty) {
    for (int x = 0; x < n; x++) {
      for (int y = 0; y < m; y++) {
        if (loc[x][y] < tim && a[x * m + y] == ch) {
          while (y < ty) {
            fans.emplace_back(-1, x, y);
            swap(a[x * m + y], a[x * m + y + 1]);
            ++y;
          }
          while (y > ty) {
            fans.emplace_back(-2, x, y);
            swap(a[x * m + y], a[x * m + y - 1]);
            --y;
          }
          while (x < tx) {
            fans.emplace_back(-3, x, y);
            swap(a[x * m + y], a[(x + 1) * m + y]);
            ++x;
          }
          while (x > tx) {
            fans.emplace_back(-4, x, y);
            swap(a[x * m + y], a[(x - 1) * m + y]);
            --x;
          }
          return ;
        }
      }
    }
    throw "Not Found!";
  }
};
int n, m, k, star;
matrix A, B, f[30];
int main() {
#ifndef LOCAL
  cin.tie(nullptr)->sync_with_stdio(false);  
#endif
  cin >> n >> m >> k;
  B = matrix(n, m);
  A = matrix(n, m);
  for (int i = 1; i <= k; i++) {
    int r, c;
    cin >> r >> c;
    f[i] = matrix(r, c);
  }
  while ((A.count() > B.count()).max()) {
    auto ca = A.count();
    bool flag = false;
    for (int t = 1; t <= k; t++) {
      auto cf = f[t].count();
      valarray<int> v = cf - ca;
      v[v < 0] = 0;
      if (v.sum() <= min(f[t].n * f[t].m - 1, n * m - ca.sum())) {
        ++tim;
        for (int i = 0; i < f[t].n; i++) {
          for (int j = 0; j < f[t].m; j++) {
            if (v[f[t][i][j]]) --v[f[t][i][j]], A.moveone('*', i, j);
            else A.moveone(f[t][i][j], i, j);
            loc[i][j] = tim;
          }
        }
        fans.emplace_back(t, 0, 0);
        for (int i = 0; i < f[t].n; i++) {
          for (int j = 0; j < f[t].m; j++) {
            A[i][j] = '*';
          }
        }
        flag = true;
        break;
      }
    }
    if (!flag) {
      cout << -1 << endl;
      return 0;
    }
  }
  valarray<int> v = B.count() - A.count();
  v[v < 0] = 0;
        ++tim;
  for (int i = 0; i < B.n; i++) {
    for (int j = 0; j < B.m; j++) {
      if (v[B[i][j]]) --v[B[i][j]], A.moveone('*', i, j);
      else A.moveone(B[i][j], i, j);
            loc[i][j] = tim;
    }
  }
  reverse(fans.begin(), fans.end());
  cout << fans.size() << endl;
  for (auto [op, x, y] : fans) cout << op << " " << x + 1 << " " << y + 1 << endl;
  return 0;
}