#include<iostream>
#include<algorithm>
#include<stack>
#include<vector>
#include<set>

using namespace std;
using ll = long long;
#include<atcoder/modint>
using mint = atcoder::modint;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int mod;
    cin>>mod;
    mint::set_mod(mod);
    int n,m;
    cin>>n>>m;
    vector<vector<mint>> a(n,vector<mint>(m,0));
    for(int i = 0;i<n;i++){
        for(int j = 0;j<m;j++){
            int b;
            cin>>b;
            a[i][j] = b;
        }
    }
    auto res = a;
    
    bool fn = true;
    for(int i = 0;i<n;i++) for(int j = 0;j<m;j++) if(a[i][j].val()!=0) fn = false;
    if(fn){
        int r = 1;
        if(n*m<=(n+m)*r){
            cout<<1<<endl;
            cout<<n<<" "<<m<<endl;
            for(int i = 0;i<n;i++){
                for(int j = 0;j<m;j++){
                    if(j) cout<<" ";
                    cout<<a[i][j].val();
                }
                cout<<endl;
            }
            return 0;
        }
        cout<<2<<endl;
        cout<<n<<" "<<1<<endl;
        for(int i = 0;i<n;i++){
            for(int j = 0;j<1;j++){
                if(j) cout<<" ";
                cout<<0;
            }
            cout<<endl;
        }
        cout<<1<<" "<<m<<endl;
        for(int i = 0;i<1;i++){
            for(int j = 0;j<m;j++){
                if(j) cout<<" ";
                cout<<0;
            }
            cout<<endl;
        }
        return 0;
    }
    
    int cnt = 0;
    vector<int> use(n,0);
    for(int i = 0;i<n;i++){
        bool fn = false;
        int ni = -1;
        for(int j = 0;j<m;j++)if(a[i][j].val()!=0){
            ni = j;
            fn = true;
            break;
        }
        if(!fn) continue;
        mint tmp = a[i][ni].inv();
        for(int j = 0;j<m;j++) a[i][j] *= tmp;
        for(int j = 0;j<n;j++){
            if(i==j) continue;
            mint now = a[j][ni];
            for(int k = 0;k<m;k++) a[j][k] -= now * a[i][k];
        }
        cnt++;
    }
    if(n*m<=(n+m)*cnt){
        cout<<1<<endl;
        cout<<n<<" "<<m<<endl;
        for(int i = 0;i<n;i++){
            for(int j = 0;j<m;j++){
                if(j) cout<<" ";
                cout<<res[i][j].val();
            }
            cout<<endl;
        }
        return 0;
    }
    
    vector<vector<mint>> b(n,vector<mint>(cnt,0));
    vector<int> now(n,-1);
    int time = 0;
    for(int i = 0;i<m;i++){
        bool fn = false;
        int ni = -1;
        int all = 0;
        for(int j = 0;j<n;j++){
            if(a[j][i].val()==1) fn = true;
            if(a[j][i].val()!=0) all++;
        }
        if(all>1||!fn) continue;
        //cout<<i<<endl;
        for(int j = 0;j<n;j++) if(a[j][i].val()==1) ni = j;
        for(int j = 0;j<n;j++) b[j][time] = res[j][i];
        now[ni] = time++;
    }
    vector<vector<mint>> c(cnt,vector<mint>(m,0));
    for(int i = 0;i<m;i++){
        for(int j = 0;j<n;j++){
            if(now[j]==-1) continue;
            c[now[j]][i] = a[j][i];
        }
    }
    cout<<2<<endl;
    cout<<n<<" "<<cnt<<endl;
    for(int i = 0;i<n;i++){
        for(int j = 0;j<cnt;j++){
            if(j) cout<<" ";
            cout<<b[i][j].val();
        }
        cout<<endl;
    }
    cout<<cnt<<" "<<m<<endl;
    for(int i = 0;i<cnt;i++){
        for(int j = 0;j<m;j++){
            if(j) cout<<" ";
            cout<<c[i][j].val();
        }
        cout<<endl;
    }

}