#include<iostream>
#include<cstdio>
#include<cstring>
#define int long long
using namespace std;
int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int reac(){
	char ch=getchar();
	while(ch!='0'&&ch!='1')ch=getchar();
	return ch-'0';
}
const int N=3030,mod=998244353;
int n,m,f[N][N],g[N][N],ans;
signed main(){
	n=read(),m=read(),ans=n*(n+1)*m*(m+1)/4*3%mod;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			f[i][j]=reac();
			g[i][j]=(g[i][j-1]+g[i-1][j]-g[i-1][j-1]+mod)%mod;
			if(f[i][j]){
				g[i][j]=(g[i][j]+i*j)%mod;
				ans=(ans+(2*g[i][j]+i*j)*(n-i+1)*(m-j+1))%mod;
			}
		}
	}
	memset(g,0,sizeof(g));
	for(int i=1;i<=n;i++){
		for(int j=m;j;j--){
			g[i][j]=(g[i][j+1]+g[i-1][j]-g[i-1][j+1]+mod)%mod;
			if(f[i][j]){
				g[i][j]=(g[i][j]+i*(m-j+1))%mod;
				ans=(ans+2*g[i-1][j+1]*(n-i+1)*j)%mod;
			}
		}
	}
	cout<<ans;
	return 0;
}