import sys

input = lambda :sys.stdin.readline().rstrip()

mod = int(input())
N,M = map(int,input().split())
A = [list(map(int,input().split())) for i in range(N)]
original = [[A[i][j] for j in range(M)] for i in range(N)]

rank = 0
B = [[] for i in range(N)]
C = []
for j in range(M):
    pivot = -1
    for i in range(j,N):
        if A[i][j]!=0:
            pivot = i
            break
    if pivot == -1:
        continue
    rank += 1
    C.append([A[pivot][j] for j in range(M)])
    inv = pow(A[pivot][j],mod-2,mod)
    for i in range(N):
        if i == pivot:
            continue
        t = A[i][j] * inv % mod
        B[i].append(t)
        for k in range(j,M):
            A[i][k] -= A[pivot][k] * t % mod
            A[i][k] %= mod
        #print(A[i])
    B[pivot].append(1)
    for j in range(M):
        A[pivot][j] = 0
    #print()

if rank == 0:
    if N*M >= N+M:
        print(2)
        print(N,1)
        for i in range(N):
            print(0)
        print(1,M)
        print(*[0]*M)
        exit()
    else:
        print(1)
        print(N,M)
        for i in range(N):
            print(*[0]*M)
        exit()

if N*M <= rank * (N+M):
    print(1)
    print(N,M)
    for i in range(N):
        print(*original[i])
else:
    print(2)
    print(N,rank)
    for i in range(N):
        print(*B[i])
    print(rank,M)
    for i in range(rank):
        print(*C[i])