#include <bits/stdc++.h>
using namespace std;
int main(){
  int MOD;
  cin >> MOD;
  int N, M;
  cin >> N >> M;
  auto modpow = [&](long long a, long long b){
    long long ans = 1;
    while (b > 0){
      if (b % 2 == 1){
        ans *= a;
        ans %= MOD;
      }
      a *= a;
      a %= MOD;
      b /= 2;
    }
    return ans;
  };
  auto modinv = [&](long long a){
    return modpow(a, MOD - 2);
  };
  vector<vector<long long>> A(N, vector<long long>(M));
  for (int i = 0; i < N; i++){
    for (int j = 0; j < M; j++){
      cin >> A[i][j];
    }
  }
  if (A == vector<vector<long long>>(N, vector<long long>(M, 0))){
    if (N + M < N * M){
      cout << 2 << endl;
      cout << N << ' ' << 1 << endl;
      for (int i = 0; i < N; i++){
        cout << 0 << endl;
      }
      cout << 1 << ' ' << M << endl;
      for (int i = 0; i < M; i++){
        cout << 0;
        if (i < M - 1){
          cout << ' ';
        }
      }
      cout << endl;
    } else {
      cout << 1 << endl;
      cout << N << ' ' << M << endl;
      for (int i = 0; i < N; i++){
        for (int j = 0; j < M; j++){
          cout << 0;
          if (j < M - 1){
            cout << ' ';
          }
        }
        cout << endl;
      }
    }
  } else {
    vector<vector<long long>> A2 = A;
    vector<vector<long long>> P(N, vector<long long>(N, 0));
    for (int i = 0; i < N; i++){
      P[i][i] = 1;
    }
    vector<vector<long long>> Q(M, vector<long long>(M, 0));
    for (int i = 0; i < M; i++){
      Q[i][i] = 1;
    }
    int rank = 0;
    for (int i = 0; i < N; i++){
      int x = -1, y = -1;
      for (int j = i; j < N; j++){
        for (int k = i; k < M; k++){
          if (A[j][k] != 0){
            x = j;
            y = k;
          }
        }
      }
      if (x == -1 && y == -1){
        break;
      }
      rank++;
      if (x != i){
        for (int j = 0; j < N; j++){
          swap(P[j][x], P[j][i]);
        }
        for (int j = 0; j < M; j++){
          swap(A[x][j], A[i][j]);
        }
      }
      if (y != i){
        for (int j = 0; j < M; j++){
          swap(Q[y][j], Q[i][j]);
        }
        for (int j = 0; j < N; j++){
          swap(A[j][i], A[j][y]);
        }
      }
      long long m = modinv(A[i][i]);
      for (int j = 0; j < N; j++){
        P[j][i] *= A[i][i];
        P[j][i] %= MOD;
      }
      for (int j = 0; j < M; j++){
        A[i][j] *= m;
        A[i][j] %= MOD;
      }
      for (int j = i + 1; j < N; j++){
        long long m2 = A[j][i];
        for (int k = 0; k < N; k++){
          P[k][i] += P[k][j] * m2;
          P[k][i] %= MOD;
        }
        for (int k = 0; k < M; k++){
          A[j][k] -= A[i][k] * m2 % MOD;
          if (A[j][k] < 0){
            A[j][k] += MOD;
          }
        }
      }
      for (int j = i + 1; j < M; j++){
        long long m2 = A[i][j];
        for (int k = 0; k < M; k++){
          Q[i][k] += Q[j][k] * m2;
          Q[i][k] %= MOD;
        }
        for (int k = 0; k < N; k++){
          A[k][j] -= A[k][i] * m2 % MOD;
          if (A[k][j] < 0){
            A[k][j] += MOD;
          }
        }
      }
    }
    if (rank * (N + M) < N * M){
      cout << 2 << endl;
      cout << N << ' ' << rank << endl;
      for (int i = 0; i < N; i++){
        for (int j = 0; j < rank; j++){
          cout << P[i][j];
          if (j < rank - 1){
            cout << ' ';
          }
        }
        cout << endl;
      }
      cout << rank << ' ' << M << endl;
      for (int i = 0; i < rank; i++){
        for (int j = 0; j < M; j++){
          cout << Q[i][j];
          if (j < M - 1){
            cout << ' ';
          }
        }
        cout << endl;
      }
    } else {
      cout << 1 << endl;
      cout << N << ' ' << M << endl;
      for (int i = 0; i < N; i++){
        for (int j = 0; j < M; j++){
          cout << A2[i][j];
          if (j < M - 1){
            cout << ' ';
          }
        }
        cout << endl;
      }
    }
  }
}