#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll int
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define mod 998244353
ll n,m,a[11][66],b[11],c[11],pw[11],f[2][729][66][6],g[2][729][66][6],ans1=0,ans2=0;
bl vis[3];
il bl chk(ll x,ll y,ll z,ll w){
	vis[0]=vis[1]=vis[2]=0;
	vis[x]=vis[y]=vis[z]=vis[w]=1;
	return vis[0]&&vis[1]&&vis[2]&&x!=w&&y!=z;
}
il ll calc(ll x,ll y){
	if(abs(x-y)<=1) return y-x;
	if(x>y) return 1;
	return -1;
}
int main(){
	n=read();
	m=read();
	fr(i,1,n) fr(j,1,m) a[i][j]=read();
	pw[0]=1;
	fr(i,1,n+1) pw[i]=pw[i-1]*3%mod;
	fr(x,0,pw[n]-1){
		fr(j,1,n) b[j]=(x/pw[j-1])%3;
		bl ck=0;
		fr(j,1,n) if(a[j][1]<3&&a[j][1]!=b[j]) ck=1;
		if(ck) continue;
		c[1]=0;
		fr(j,2,n) c[j]=c[j-1]+calc(b[j-1],b[j]);
		ll minn=0,dis=0;
		fr(j,2,n){
			if(c[j]<minn){
				minn=c[j];
				dis=j-1;
			}
		}
		f[0][x][-minn][dis+1]=1;
		g[0][x][-minn][dis+1]=dis;
	}
	bl o=1;
	fr(j,2,m){
		fr(i,1,n){
			fr(x,0,pw[n+1]-1) fr(k,0,n+j-2) fr(l,0,n) f[o][x][k][l]=g[o][x][k][l]=0;
			fr(x,0,pw[n+1]-1){
				fr(k,0,n) b[k]=(x/pw[k])%3;
				c[0]=0;
				fr(k,1,n) c[k]=c[k-1]+calc(b[k-1],b[k]);
				fr(k,0,n+j-2){
					fr(l,0,n){
						if(!f[o^1][x][k][l]&&!g[o^1][x][k][l]) continue;
						fr(col,0,2){
							if(a[i][j]<3&&a[i][j]!=col) continue;
							if(i==1){
								ll kk=k+calc(b[0],col),y=(x-b[n]*pw[n])*3+col;
								if(kk<0||(!kk&&l>2)){
									f[o][y][0][1]=(f[o][y][0][1]+f[o^1][x][k][l])%mod;
									g[o][y][0][1]=(g[o][y][0][1]+1ll*f[o^1][x][k][l]*(j-1))%mod;
								}
								else{
									f[o][y][kk][max(0,l-1)]=(f[o][y][kk][max(0,l-1)]+f[o^1][x][k][l])%mod;
									g[o][y][kk][max(0,l-1)]=(g[o][y][kk][max(0,l-1)]+g[o^1][x][k][l])%mod;
								}
							}
							else if(!chk(b[i-1],b[i-2],b[i],col)){
								ll kk=k+c[i]+calc(b[i],col),y=x+(col-b[i-1])*pw[i-1];								
								if(kk<0||(!kk&&l>i)){
									f[o][y][k-kk][i]=(f[o][y][k-kk][i]+f[o^1][x][k][l])%mod;
									g[o][y][k-kk][i]=(g[o][y][k-kk][i]+1ll*f[o^1][x][k][l]*(i+j-2))%mod;
								}
								else{
									f[o][y][k][l]=(f[o][y][k][l]+f[o^1][x][k][l])%mod;
									g[o][y][k][l]=(g[o][y][k][l]+g[o^1][x][k][l])%mod;
								}
							}
						}
					}
				}
			}
			o^=1;
		}
	}
	fr(x,0,pw[n+1]-1){
		fr(k,0,n+m-2){
			fr(l,0,n){
				if(!f[o^1][x][k][l]) continue;
				ans1=(ans1+f[o^1][x][k][l])%mod;
				ans2=(ans2+g[o^1][x][k][l])%mod;
			}
		}
	}
	pf("%d %d\n",ans1,ans2);
}