#include <bits/stdc++.h>

using namespace std;

const int mod = 998244353;

int n, m;
int a[110][2010];
int f[110][210];
int sum = 0;

int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= m; ++j) scanf("%d", &a[i][j]), a[i][0] = (a[i][0] + a[i][j]) % mod;
	
	sum = a[1][0] + 1;
	for (int i = 2; i <= n; ++i) sum = 1ll * sum * (a[i][0] + 1) % mod;

	f[0][100] = 1;
	int res = 0;

	for (int j = 1; j <= m; ++j) {
		for (int i = 1; i <= n; ++i) {
			for (int k = 0; k <= 201; ++k) {
				f[i][k] = 0;
			}
		}
		
//		cout << j << "----" << endl;

		int l = 100, r = 100;
		for (int i = 1; i <= n; ++i) {
			--l, ++r;
			for (int k = l; k <= r; ++k) {
				f[i][k] = f[i - 1][k];
				
				if (k) f[i][k] += 1ll * f[i - 1][k - 1] * a[i][j] % mod;
				if (f[i][k] >= mod) f[i][k] -= mod;
				if (k + 1 <= r) f[i][k] += 1ll * f[i - 1][k + 1] * ((a[i][0] - a[i][j] + mod) % mod) % mod;
				if (f[i][k] >= mod) f[i][k] -= mod;
				
//				cout << f[i][k] << ' ' << i << ' ' << k << endl;
			}
		}
		
		for (int k = 101; k <= 201; ++k) {
			res += f[n][k];
			if (res >= mod) res -= mod; 
		}
	}
	
//	cout << res << ' ' << sum << endl;

	printf("%d\n", (sum - res - 1 + mod) % mod);

	return 0;
}