84pts求调

#include<bits/stdc++.h>
using namespace std;
#define rep(x,y,z) for(int x=y;x<=z;x++)
#define repn(x) rep(x,1,n)
#define int long long
const int mod=998244353;
int n,m,a[109][1009],s[109],f[109][418],ans=1;
int calc(int x){
	memset(f,0,sizeof(f));
	f[0][n+3]=1;
	repn(i){
		rep(j,-i,i){
			int k=j+n+3;
			f[i][k]=0;
			f[i][k]+=f[i-1][k-1]*a[i][x]%mod;f[i][k]%=mod;
			f[i][k]+=f[i-1][k]%mod;f[i][k]%=mod;
			f[i][k]+=f[i-1][k+1]*(s[i]-a[i][x]+mod)%mod;f[i][k]%=mod;
		}
	}
	int res=0;
	rep(i,1,n) res+=f[n][i+n+3]%mod,res%=mod;
	return res;
}
signed main()
{
	cin>>n>>m;
	repn(i){
		rep(j,1,m) cin>>a[i][j],s[i]+=a[i][j],s[i]%=mod;
		ans=ans*(s[i]+1)%mod;
	}
	ans--;ans+=mod;ans%=mod;
	rep(i,1,m) ans=(ans-calc(i)%mod+mod)%mod;
	cout<<ans<<"\n";
	return 0;
}