#include<iostream>
#include<cstdio>
#define N 50
#define W 113
#define M 729
#define K 6
#define mod 998244353
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
int n,m,res=1,ans,ans2,pw3[K+1],a[K+1][N+1],dp[N+1][M+1],DP[N+1][M+1][W+1][K+1],DSP[N+1][M+1][W+1][K+1],F[K+1][M+1][W+1][K+1],minn[M+1],ps[M+1],num[M+1][N+1];
bool used[M+1][M+1],vis[N+1][M+1],tb[3][3][3][3];
int get(int x,int y)
{
	if (x==y) return 0;
	else if ((x+1)%3==y) return 1;
	else return -1;
}
int main()
{
	int rst;
	bool op;
	for (int i=0;i<=2;++i)
		for (int j=0;j<=2;++j)
			for (int k=0;k<=2;++k)
				for (int t=0;t<=2;++t)
				{
					if (i==j&&k!=i&&t!=i&&k!=t) tb[i][j][k][t]=1;
					else if (k==t&&i!=k&&j!=k&&i!=j) tb[i][j][k][t]=1;
					else if (i==k&&j!=i&&t!=i&&j!=t) tb[i][j][k][t]=1;
					else if (j==t&&i!=j&&k!=j&&i!=k) tb[i][j][k][t]=1;
				}
	n=read(),m=read(),pw3[0]=1;
	for (int i=1;i<=n;++i) pw3[i]=pw3[i-1]*3;
	res=pw3[n];
	for (int i=1;i<=n;++i)
		for (int j=1;j<=m;++j)
			a[i][j]=read();
	for (int i=0;i<res;++i)
		for (int j=1;j<=n;++j)
			num[i][j]=(i/pw3[j-1])%3;
	for (int i=0;i<res;++i)
	{
		rst=0,minn[i]=inf;
		for (int j=1;j<=n;++j)
		{
			if (j!=1) rst+=get(num[i][j-1],num[i][j]);
			if (rst<minn[i]) minn[i]=rst,ps[i]=j;
		}
		for (int j=0;j<res;++j)
		{
		    used[i][j]=1;
			for (int k=1;k<=n-1;++k)
				if (tb[num[i][k]][num[i][k+1]][num[j][k]][num[j][k+1]])
					used[i][j]=0;
		}
	}
	for (int i=0;i<res;++i)
	{
		op=1;
		for (int j=1;j<=n;++j) op&=(a[j][1]==3||a[j][1]==num[i][j]);
		vis[1][i]=op;
		if (op) dp[1][i]=1;
	}
	for (int i=2;i<=m;++i)
		for (int j=0;j<res;++j)
		{
			op=1;
			for (int k=1;k<=n;++k) op&=(a[k][i]==3||a[k][i]==num[j][k]);
			vis[i][j]=op;
			if (op)
			{
				for (int k=0;k<res;++k)
					if (used[k][j])
						Adder(dp[i][j],dp[i-1][k]);
			}
		}
	for (int i=0;i<res;++i) Adder(ans,dp[m][i]);
	for (int k=0;k<res;++k)
		if (vis[1][k])
		{
			DP[1][k][-minn[k]][n]=1;
			if (ps[k]-1!=0) DP[1][k][-minn[k]][ps[k]-1]=1;
		}
	for (int k=2;k<=m;++k)
	{
		for (int r=0;r<=n;++r)
		{
			for (int t=1;t<=n;++t)
				for (int s=0;s<res;++s)
					for (int w=0;w<=n+k+1;++w)
						for (int q=0;q<=2;++q)
							F[t][s][w][q]=0;
			for (int t=0;t<res;++t)
				for (int s=0;s<=n+m;++s)
					for (int w=0;w<=2;++w)
						if (DP[k-1][t][s][r])
							Adder(F[1][t][s+get(t%3,w)+1][w],DP[k-1][t][s][r]);
			for (int t=2;t<=n;++t)
				for (int s=0;s<res;++s)
					for (int w=0;w<=n+k+1;++w)
						for (int q=0;q<=2;++q)
							if (F[t-1][s][w][q])
								for (int e=0;e<=2;++e)
									if (!tb[num[s][t-1]][num[s][t]][q][e])
										Adder(F[t][s+(q-num[s][t-1])*pw3[t-2]][w][e],F[t-1][s][w][q]);
			for (int t=0;t<res;++t)
				for (int s=0;s<=n+k+1;++s)
					for (int w=0;w<=2;++w)
						if (F[n][t][s][w])
							Adder(DSP[k][t+(w-num[t][n])*pw3[n-1]][s][r],F[n][t][s][w]);
		}
		for (int t=0;t<res;++t)
			if (vis[k][t])
				for (int s=0;s<=n+k+1;++s)
					for (int r=0;r<=n;++r)
						if (DSP[k][t][s][r])
						{
							if (s-1+minn[t]>0)
							{
								if (r==n) Adder(DP[k][t][s-1][r],DSP[k][t][s][r]);
								else if (r==1) Adder(DP[k][t][s-1][0],1ll*DSP[k][t][s][r]*(k-1)%mod);
								else Adder(DP[k][t][s-1][max(r-1,0)],DSP[k][t][s][r]);
							}
							else if (s-1+minn[t]==0)
							{
								if (r==n) Adder(DP[k][t][s-1][r],DSP[k][t][s][r]);
								else
								{
									if (min(r,ps[t])==1) Adder(DP[k][t][s-1][0],1ll*DSP[k][t][s][r]*(k-1)%mod);
									else Adder(DP[k][t][s-1][max(min(r,ps[t])-1,0)],DSP[k][t][s][r]);
								}
							}
							else if (s-1+minn[t]<0)
							{
								if (r==n)
								{
									Adder(DP[k][t][-minn[t]][r],DSP[k][t][s][r]);
									if (ps[t]==1) Adder(DP[k][t][-minn[t]][0],1ll*DSP[k][t][s][r]*(k-1)%mod);
									else Adder(DP[k][t][-minn[t]][ps[t]-1],DSP[k][t][s][r]);
								}
							}
						}
	}
	for (int k=0;k<res;++k)
		for (int t=0;t<=n+m;++t)
		{
			Adder(ans2,DP[m][k][t][0]);
			for (int r=1;r<=n-1;++r) Adder(ans2,1ll*DP[m][k][t][r]*(m+r-1)%mod);
		}
	printf("%d %d\n",ans,ans2);
	return 0;
}