80分WA3个点求调

//看题解思路，题解：https://www.luogu.com.cn/article/tlhoa484     扶苏
//s:80
#include<iostream>
#include<cstring>
using namespace std;
bool flag[1010][1010];
int c,f;
int n,m;
bool fc,ff;
int ri[1010][1010];
int up[1010][1010];
int down[1010][1010];
#define MOD 998244353
void C(){
	for(int i=1;i<=n;i++){
		for(int j=m;j>=1;j--){
			if(flag[i][j])continue;
			ri[i][j]=ri[i][j+1]+1;
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(i==1||i==2||flag[i][j]||flag[i-1][j]||flag[i-2][j])continue;
			up[i][j]=(up[i-1][j]%MOD+ri[i-2][j]-1%MOD)%MOD;
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			c+=up[i][j]*(ri[i][j]-1)%MOD;
		}
	}
}
void F(){
	for(int i=n;i>=1;i--){
		for(int j=1;j<=m;j++){
			
			if(flag[i][j]){down[i][j]=0;continue;}
			if(i==n){down[i][j]=1;continue;}
			down[i][j]=(down[i+1][j]+1)%MOD;
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(flag[i][j])continue;
			f+=up[i][j]*(ri[i][j]-1)%MOD*(down[i][j]-1)%MOD;
		}
	}
}
int main(){
	//freopen("plant1.in","r",stdin);
	//freopen("plant1.out","w",stdout);
	int T,id;
	cin>>T>>id;
	while(T--){
		memset(ri,0,sizeof ri);
		memset(up,0,sizeof up);
		memset(down,0,sizeof down);
		c=0,f=0;
		cin>>n>>m>>fc>>ff;
		
		for(int i=1;i<=n;i++){
			getchar();
			for(int j=1;j<=m;j++){
				char p=getchar();
				flag[i][j]=(p=='1');
			}
		}
		
		if(fc){
			C();
		}
		if(ff){
			if(!fc)C();
			F();
		}
		cout<<c%MOD<<" "<<f%MOD<<endl;
	}
	
	return 0;
}