#include <bits/stdc++.h>

using namespace std;

const int N = 105;

int n, m, a[N][N], b[N];
vector< array<int, 3> > res;

void opt(int dir, int x, int y) {
    if (dir == 1) {
        y = (y % m + m) % m;
        res.push_back({dir, x, y});
        for (int i = 0; i < m; ++i) b[(i + y) % m] = a[x][i];
        for (int i = 0; i < m; ++i) a[x][i] = b[i];
    } else {
        y = (y % n + n) % n;
        res.push_back({dir, x, y});
        for (int i = 0; i < n; ++i) b[(i + y) % n] = a[i][x];
        for (int i = 0; i < n; ++i) a[i][x] = b[i];
    }
}

int solve() {
    for (int i = 0; i + 1 < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (a[i][j] == i * m + j) continue;
            for (int k = j + 1; k < m; ++k) {
                if (a[i][k] == i * m + j) opt(2, k, 1), opt(1, i + 1, (k == j + 1 ? 1 : -1)), opt(2, k, -1);
            }
            for (int k = i + 1; k < n; ++k) {
                if (a[k][j] == i * m + j) opt(1, k, 1);
            }
            for (int k = i + 1; k < n; ++k) {
                for (int l = 0; l < m; ++l) {
                    if (a[k][l] != i * m + j) continue;
                    opt(2, j, k - i), opt(1, k, j - l), opt(2, j, i - k);
                    break;
                }
            }
        }
    }
    int D = 1;
    for (int i = 0; i < m; ++i) {
        if (a[n - 1][i] == (n - 1) * m + i) continue;
        for (int j = i + 1; j < m; ++j) {
            if (a[n - 1][j] != (n - 1) * m + i) continue;
            opt(1, n - 1, m - 1 - j), opt(2, m - 1, D), opt(1, n - 1, j - i), opt(2, m - 1, -D);
            opt(1, n - 1, m - (j - i)), opt(2, m - 1, D), opt(1, n - 1, j + 1);
            D = -D;
            break;
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (a[i][j] != i * m + j) return 0;
        }
    }
    printf("%d\n", (int)res.size());
    for (auto [x, y, z] : res) printf("%d %d %d\n", x, y + 1, z);
    return 1;
}

int back[N][N];

signed main() {
    scanf("%d%d", &n, &m);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) scanf("%d", &back[i][j]);
    }
    mt19937 rnd;
    while (1) {
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) a[i][j] = back[i][j];
        }
        res.clear();
        for (int i = 0; i < n; ++i) opt(1, i, rnd() % m);
        for (int i = 0; i < m; ++i) opt(2, i, rnd() % n);
        if (solve()) return 0;
    }
    return 0;
}