Emiya 家今天的饭（计数4, dp19）

//https://www.luogu.com.cn/problem/P5664
#include<bits/stdc++.h>
#include<unordered_map>
#include<array>
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(),a.end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-4;
const ll mod = 998244353;
const int N = 1e2 + 5;
const int M = 2e3 + 5;

/*
考虑容斥, 因为不合法的列显然只有一列， 所以只要容斥一次即可
先统计出不考虑每列都不超过k/2的条件时的数量,  再减去不合法的数量。 
*/

#define int ll
int n, m;
int a[N][M], sum[N], dp[N][N * 2];

void solve()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			cin >> a[i][j];
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= m; j++)
			sum[i] = (sum[i] + a[i][j]) % mod;

	dp[0][0] = 1;
	for (int i = 1; i <= n; i++)//所有情况， dp转移显然
	{
		for (int j = 0; j <= i; j++)
		{
			if (j == 0)
				dp[i][j] = 1;
			else
				dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1] * sum[i] % mod) % mod;
		}
	}
	int ans = 0;
	for (int i = 1; i <= n; i++)
		ans = (ans + dp[n][i]) % mod;

	for (int col = 1; col <= m; col++)//枚举不合法的列是哪个
	{
		memset(dp, 0, sizeof dp);
		dp[0][n] = 1;
		for (int i = 1; i <= n; i++)//dp[i][j]， 前i行选的不合法列中选的数量比其他列的数量多j个
		{
			for (int j = (n - i); j <= n + i; j++)
			{
				if (j == 0)
					dp[i][j] = (dp[i - 1][j] + dp[i - 1][j + 1] * (sum[i] - a[i][col] + mod) % mod) % mod;
				else
					dp[i][j] = (dp[i - 1][j] + dp[i - 1][j - 1] * a[i][col] % mod + dp[i - 1][j + 1] * (sum[i] - a[i][col] + mod) % mod) % mod;
					///不选第i行的,     第i行选的是不合法的,                   第i行选的是合法的
			}
		}
		for (int j = n + 1; j <= n * 2; j++)
			ans = (ans - dp[n][j] + mod) % mod;
	}

	cout << ans << '\n';
}

signed main()
{
	IOS;
	int t = 1;
	//cin >> t;
	while (t--)
		solve();
	return 0;
}