萌新求助为什么RE或者TLE

#include<bits/stdc++.h>
#define ll long long
#define qmod(x) ((x+mod)%mod)
using namespace std;
const int N=1e3+4;
const int mod=998244353;

inline int read()
{
	int x=0,y=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-') y=-y;c=getchar();}
	while(c>='0'&&c<='9'){x=x*10+(c^'0');c=getchar();}
	return x*y;
}

int n,m,c,f;
int mp[N][N],sum_hang[N][N],sum_lie[N][N];
ll sum_c,sum_f;
//sum_hang[i][j]表示第i行j列向右直到遇到1有几个
//sum_lie[i][j]表示第i行j列向下直到遇到1有几个

//int qmod(int k){return (k+mod)%mod;}

signed main()
{
	int T=read();
	int id=read();
	while(T--)
	{
		n=read(),m=read(),c=read(),f=read();
		for(int i=1;i<=n;i++){for(int j=1;j<=m;j++) scanf("%1d",&mp[i][j]);}
		
		sum_c=sum_f=0;
		
		for(int i=1;i<=m;i++) sum_lie[n+1][i]=0;
		for(int i=1;i<=n;i++) sum_hang[i][m+1]=0;
		
		for(int i=1;i<=n;i++) for(int j=m;j;j--) sum_hang[i][j]=mp[i][j]?0:sum_hang[i][j+1]+1;
		for(int j=1;j<=m;j++) for(int i=n;i;i--) sum_lie[i][j]=mp[i][j]?0:sum_lie[i+1][j]+1;
		
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
			{
				if(mp[i][j]||sum_hang[i][j]==1) continue;
				if(mp[i+1][j]) continue;
				for(int k=i+2;k<=n&&mp[k][j]!=1;k++)
				{
					if(sum_hang[k][j]<=1) continue;
					sum_c=((sum_c+c*(sum_hang[i][j]-1)*(sum_hang[k][j]-1))+mod)%mod;
					if(sum_hang[k][j]<=1||sum_lie[k][j]<=1) continue;
					sum_f=((sum_f+f*((((sum_hang[i][j]-1)*(sum_hang[k][j]-1))*(sum_lie[k][j]-1)+mod)%mod))+mod)%mod;
				}
			}
		}
		printf("%lld %lld\n",sum_c,sum_f);
	}
	return 0;
}