#include<iostream>
#include<cstring>
#include<vector>
#define int unsigned long long
using namespace std;
int a[1010][1010],sum[1010][1010],ssum[1010][1010],vs[1010][1010],vsum[1010][1010],vsu[1010][1010],t,id,n,m,c,f,ans,ans1;
/* utility */


/* checker */


/* Solution */
void Solve1() {
	cout << 0 << " " << 0 << "\n";
}
void Solve100() {
	for(int i = 1;i <= m;i++) {
		vs[n + 1][i] = n + 1;
		vsu[0][i] = 0;
	}
	for(int i = n;i >= 1;i--) {
		for(int j = 1;j <= m;j++) {
			ssum[i][j] = ssum[i + 1][j] + sum[i][j];
			if(!a[i][j]) vs[i][j] = vs[i + 1][j];
			else vs[i][j] = i;
		}
	}
	for(int i = 1;i <= n;i++) {
		for(int j = 1;j <= m;j++) {
			vsum[i][j] = vsum[i - 1][j] + sum[i][j];
			if(!a[i][j]) vsu[i][j] = vsu[i - 1][j];
			else vsu[i][j] = i;
		}
	}
	/*for(int i = 1;i <= n;i++) {
		for(int j = 1;j <= m;j++) {
			cout << sum[i][j] << " ";
		}
		cout << "\n";
	}*/ 
	for(int i = 1;i <= m;i++) {
		for(int j = 1;j <= n - 2;j++) {
			if(a[j][i]) continue;
			int mmax = vs[j][i] - 1;
			if(mmax <= j + 1) continue;
			(ans += sum[j][i + 1] * (ssum[j + 2][i + 1] - ssum[mmax + 1][i + 1]) % 998244353) %= 998244353;
			//cout << j << " " << i << " " << sum[j][i + 1] << " " << (ssum[j + 2][i + 1] - ssum[mmax + 1][i + 1]) << " ";
		}
		//cout << "\n";
	}
	for(int i = 1;i <= m - 1;i++) {
		for(int j = n;j >= 3;j--) {
			int dn = vs[j][i] - j - 1;
			if(dn <= 0) continue;
			int mmax = vsu[j][i];
			if(mmax >= j - 2) continue;
			(ans1 += dn * (sum[j][i + 1]) % 998244353 * (vsum[j - 1][i + 1] - vsum[mmax][i + 1]) % 998244353) %= 998244353;
			//cout << j << " " << i << " " << dn << " " << sum[j][i + 1] << " " << (vsum[j - 1][i + 1] - vsum[mmax][i + 1]) << " ";
		}
		//cout << "\n";
	}
	cout << (ans * c) % 998244353 << " " << (ans1 * f) % 998244353 << "\n";
}

signed main()
{
	cin >> t >> id;
	while(t--) {
		cin >> n >> m >> c >> f;
		memset(a,0,sizeof(a));
		for(int i = 1;i <= n;i++) {
			for(int j = 1;j <= m;j++) {
				char c;
				cin >> c;
				if(c == '1') a[i][j] = 1;
				else a[i][j] = 0;
			}
		}
		memset(sum,0,sizeof(sum));
		memset(ssum,0,sizeof(ssum));
		memset(vsum,0,sizeof(vsum));
		memset(vs,0,sizeof(vs));
		memset(vsu,0,sizeof(vsu));
		ans = 0,ans1 = 0;
		for(int i = 1;i <= n;i++) {
			for(int j = m;j >= 1;j--) {
				if(!a[i][j]) sum[i][j] = sum[i][j + 1] + 1;
				else sum[i][j] = 0;
			}
		}
		if(c == 0 && f == 0) {
			Solve1();
		} else {
			Solve100();
		}
	}
}