#line 1 "I.cpp"
// #pragma GCC target("avx2,avx512f,avx512vl,avx512bw,avx512dq,avx512cd,avx512vbmi,avx512vbmi2,avx512vpopcntdq,avx512bitalg,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("Ofast")

#line 2 "/home/sigma/comp/library/template.hpp"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}

/*
x       0  1  2  3  4  5  6  7  8  9
bsr(x) -1  0  1  1  2  2  2  2  3  3
最上位bit
*/
int bsr(int x){
	return x == 0 ? -1 : 31 ^ __builtin_clz(x);
}
int bsr(uint x){
	return x == 0 ? -1 : 31 ^ __builtin_clz(x);
}
int bsr(ll x){
	return x == 0 ? -1 : 63 ^ __builtin_clzll(x);
}
int bsr(ull x){
	return x == 0 ? -1 : 63 ^ __builtin_clzll(x);
}

/*
x       0  1  2  3  4  5  6  7  8  9
bsl(x) -1  0  1  0  2  0  1  0  3  0
最下位bit
*/
int bsl(int x){
	if(x==0) return -1;
	return __builtin_ctz(x);
}
int bsl(uint x){
	if(x==0) return -1;
	return __builtin_ctz(x);
}
int bsl(ll x){
	if(x==0) return -1;
	return __builtin_ctzll(x);
}
int bsl(ull x){
	if(x==0) return -1;
	return __builtin_ctzll(x);
}


template<class T>
T rnd(T l,T r){	//[l,r)
	using D = uniform_int_distribution<T>;
	static random_device rd;
	static mt19937 gen(rd());
	return D(l,r-1)(gen);
}
template<class T>
T rnd(T n){	//[0,n)
	return rnd(T(0),n);
}
#line 1 "/home/sigma/comp/library/math/mint0.cpp"
/*
	任意 mod
	cin >> mod してから使う InitFact とかを先にしないように注意
*/

unsigned int mod = 1;
struct ModInt{
	using uint = unsigned int;
	using ll = long long;
	using ull = unsigned long long;

	uint v;
	ModInt():v(0){}
	ModInt(ll _v):v(normS(_v%mod+mod)){}
	explicit operator bool() const {return v!=0;}
	static uint normS(const uint &x){return (x<mod)?x:x-mod;}		// [0 , 2*mod-1] -> [0 , mod-1]
	static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
	ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
	ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
	ModInt operator-() const { return make(normS(mod-v)); }
	ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
	ModInt operator/(const ModInt& b) const { return *this*b.inv();}
	ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
	ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
	ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
	ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
	ModInt& operator++(int){ return *this=*this+1;}
	ModInt& operator--(int){ return *this=*this-1;}
	template<class T> friend ModInt operator+(T a, const ModInt& b){ return (ModInt(a) += b);}
	template<class T> friend ModInt operator-(T a, const ModInt& b){ return (ModInt(a) -= b);}
	template<class T> friend ModInt operator*(T a, const ModInt& b){ return (ModInt(a) *= b);}
	template<class T> friend ModInt operator/(T a, const ModInt& b){ return (ModInt(a) /= b);}
	ModInt pow(ll p) const {
		if(p<0) return inv().pow(-p);
		ModInt a = 1;
		ModInt x = *this;
		while(p){
			if(p&1) a *= x;
			x *= x;
			p >>= 1;
		}
		return a;
	}
	ModInt inv() const {		// should be prime
		return pow(mod-2);
	}
	// ll extgcd(ll a,ll b,ll &x,ll &y) const{
	// 	ll p[]={a,1,0},q[]={b,0,1};
	// 	while(*q){
	// 		ll t=*p/ *q;
	// 		rep(i,3) swap(p[i]-=t*q[i],q[i]);
	// 	}
	// 	if(p[0]<0) rep(i,3) p[i]=-p[i];
	// 	x=p[1],y=p[2];
	// 	return p[0];
	// }
	// ModInt inv() const {
	// 	ll x,y;
	// 	extgcd(v,mod,x,y);
	// 	return make(normS(x+mod));
	// }

	bool operator==(const ModInt& b) const { return v==b.v;}
	bool operator!=(const ModInt& b) const { return v!=b.v;}
	bool operator<(const ModInt& b) const { return v<b.v;}
	friend istream& operator>>(istream &o,ModInt& x){
		ll tmp;
		o>>tmp;
		x=ModInt(tmp);
		return o;
	}
	friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt;

V<mint> fact,ifact,invs;
mint Choose(int a,int b){
	if(b<0 || a<b) return 0;
	return fact[a] * ifact[b] * ifact[a-b];
}
void InitFact(int N){	//[0,N]
	N++;
	fact.resize(N);
	ifact.resize(N);
	invs.resize(N);
	fact[0] = 1;
	rep1(i,N-1) fact[i] = fact[i-1] * i;
	ifact[N-1] = fact[N-1].inv();
	for(int i=N-2;i>=0;i--) ifact[i] = ifact[i+1] * (i+1);
	rep1(i,N-1) invs[i] = fact[i-1] * ifact[i];
}
#line 6 "I.cpp"

VV<mint> solve(VV<mint> A){
	int N = si(A);
	int p = mod;

	auto A_in = A;

	// ans_v[i] = \sum_j buf[i][j] * current_v[j]
	VV<mint> buf(N,V<mint>(N)); rep(i,N) buf[i][i] = 1;

	// swap(v[i], v[j])
	auto Swap = [&](int i, int j){
		if(i == j) return;
		rep(k,N) swap(buf[k][i], buf[k][j]);
		swap(A[i],A[j]);
		rep(k,N) swap(A[k][i], A[k][j]);
		shows("--------- swaped",i,j);
		show(A);
	};
	// v[i] += c * v[j]
	auto Add = [&](int i, int j, mint c){
		assert(i != j);
		rep(k,N) buf[k][j] -= buf[k][i] * c;
		rep(k,N) A[i][k] += A[j][k] * c;
		rep(k,N) A[k][i] += A[k][j] * c;
		shows("--------- added",i,j,c);
		show(A);
	};
	// v[i] *= c
	auto Mul = [&](int i, mint c){
		assert(c);
		mint ic = c.inv();
		rep(k,N) buf[k][i] *= ic;
		rep(k,N) A[i][k] *= c;
		rep(k,N) A[k][i] *= c;
		shows("--------- muled",i,c);
		show(A);
		show(buf);
	};

	int I = 0;
	while(I < N){
		for(int i=I;i<N;i++){
			if(A[i][i]){
				Swap(I,i); break;
			}
		}
		if(A[I][I]){
			mint c = -A[I][I].inv();
			for(int i=I+1;i<N;i++) Add(i, I, c*A[I][i]);
			I++;
			continue;
		}
		bool allzero = true;
		for(int i=I;i<N;i++) for(int j=I;j<N;j++) if(A[i][j]){
			Swap(I,i); Swap(I+1,j);
			allzero = false;
			goto done;
		}
		done:
		if(allzero){
			break;
		}
		assert(A[I][I+1]);
		if(p != 2){
			Add(I,I+1,1);
		}else{
			if(I == 0){
				return {};
			}
			for(int j=I+2;j<N;j++){
				if(A[I][j]) Add(j, I+1, 1);
				if(A[I+1][j]) Add(j, I, 1);
			}
			Add(I-1,I,1); Add(I-1,I+1,1);
			Add(I,I-1,1); Add(I+1,I-1,1);
			I += 2;
		}
	}

	VV<mint> v(N,V<mint>(N+1));
	int D = 0;

	V<bool> sq(p);
	V<int> root(p);
	int Z = 0;
	mint Z1 = 0;
	per(i,p){
		int ii = (mint(i)*i).v;
		sq[ii] = true;
		root[ii] = i;
	}
	rep1(x,p-2){
		if(sq[x] && !sq[x+1]){
			Z = root[x];
			Z1 = x+1;
			break;
		}
	}
	show(sq); show(root); show(Z);

	rep(i,I) if(!sq[A[i][i].v]){
		for(int j=i+1;j<I;j++) if(sq[A[j][j].v]){
			Swap(i,j); break;
		}
	}

	int num1 = 0, num2 = 0;
	rep(i,I){
		if(sq[A[i][i].v]) num1++;
		else num2++;
	}

	for(int i=num1;i<num1+num2;i++){
		mint c = root[(Z1/A[i][i]).v];
		Mul(i,c);
	}

	rep(i,num1){
		v[i][D] = root[A[i][i].v];
		D++;
	}
	rep(_,num2/2){
		int i = num1 + _*2;
		v[i][D] = 1; v[i+1][D] = -Z; D++;
		v[i][D] = Z; v[i+1][D] = 1; D++;
	}
	if(num2 & 1){
		int i = num1 + num2 - 1;
		v[i][D] = 1; D++;
		v[i][D] = Z; D++;
	}

	show(v);

	VV<mint> ans_v(N, V<mint>(D));
	rep(i,N){
		rep(j,N){
			rep(k,D) ans_v[i][k] += buf[i][j] * v[j][k];
		}
	}
	show(ans_v);
	{
		rep(i,N) rep(j,N){
			mint sm = 0;
			rep(k,D) sm += ans_v[i][k] * ans_v[j][k];
			assert(sm == A_in[i][j]);
		}
	}

	return ans_v;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	int N; cin >> N >> mod;
	VV<mint> A(N,V<mint>(N)); rep(i,N) rep(j,N) cin >> A[i][j];

	auto f = solve(A);
	if(f.empty()){
		rep(i,N) A[i].eb(0);
		A.eb(V<mint>(N+1));
		A[N][N] = 1;
		f = solve(A);
		assert(!f.empty());
	}

	int D = si(f[0]);
	cout << D << endl;
	rep(i,N){
		rep(k,D) cout << f[i][k] << " ";
		cout << endl;
	}
}