#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i ++ )
#define rop(i, a, b) for (int i = (a); i < (b); i ++ )
#define dep(i, a, b) for (int i = (a); i >= (b); i -- )
#define dop(i, a, b) for (int i = (a); i > (b); i -- )

#define Darr(a, L, R) cerr << #a "[" << L << " ~ " << R << "] = "; rep(x, L, R) cerr << a[x] << " "; cerr << '\n';
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define D(x) (cerr << #x << " = " << x << '\n')
#define vit vector<int>::iterator
#define all(x) x.begin(), x.end()
#define min(a, b) (a < b ? a : b)
#define max(a, b) (a > b ? a : b)
#define chkmin(a, b) (a = min(a, b))
#define chkmax(a, b) (a = max(a, b))
#define sit set<int>::iterator
#define lowbit(x) (x & -x)
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pi acos(-1)
#define gc getchar
#define pc putchar
#define db double
#define y second
#define x first

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<db, db> PDD;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
const int mod = 998244353;
const int eps = 1e-9;

const int N = 1010; int T = 1, id = 1;
void print(int x) { dep(i, 20, 0) pc(((x >> i) & 1) ? '1' : '0'); }
int qpow(int a, int b = mod - 2, int s = 1) { for (; b; b >>= 1, a = 1ll * a * a % mod) if (b & 1) s = 1ll * s * a % mod; return s; }
namespace IO {
	void read() { return; }
	void write(char ch) { pc(ch); return; }
	void write() { return; }
	template <typename T> void read(T &x) { x = 0; T w = 0; char ch = gc(); while (ch < '0' || ch > '9') w |= (ch == '-'), ch = gc(); while ('0' <= ch && ch <= '9') x = x * 10 + (ch ^ 48), ch = gc(); x = w ? -x : x; }
	template <typename T> void print(T x) { if (!x) return; print<T>(x / 10), pc((x % 10) ^ '0'); }
	template <typename T> void write(T x) { if (x > 0) print<T>(x); else if (x < 0) pc('-'), print<T>(-x); else pc('0'); }
	template <typename T> void write(T x, char en) { write<T>(x), pc(en); }
	template <typename T, typename ...T2> void read(T &s, T2 &...oth) { read(s); read(oth...); return; }
}; using namespace IO;

int n, m, c, f;
int suf[N][N], s[N][N];
char g[N][N];
void sub() {
	read(n, m, c, f);
	rep(i, 0, n + 1) rep(j, 0, m + 1) suf[i][j] = s[i][j] = 0;
	rep(i, 1, n) scanf("%s", g[i] + 1);
	rep(i, 1, n) dep(j, m, 1) if (g[i][j] == '0') 
		suf[i][j] = suf[i][j + 1] + 1; // 从 (i, j) 向后延伸的最大长度 
	rep(j, 1, m) rep(i, 1, n) if (g[i][j] == '0')
		s[i][j] = s[i - 1][j] + suf[i][j] - 1;
	rep(i, 2, n) rep(j, 1, m) {
		if (g[i][j] == '0') s[i][j] -= suf[i][j] - 1;
		if (g[i - 1][j] == '0') s[i][j] -= suf[i - 1][j] - 1;
	}
	rep(i, 1, n) rep(j, 1, m) s[i][j] %= mod;
	auto calc_C = [&]() -> int {
		int ans = 0;
		rep(i, 3, n) rep(j, 1, m - 1) if (g[i][j] == '0')
			ans = (ans + s[i][j] * (suf[i][j] - 1) % mod) % mod;
		return (ans % mod + mod) % mod;
	};
	auto calc_F = [&]() -> int {
		int ans = 0;
		rep(j, 1, m - 1) {
			int cnt = 0;
			dep(i, n, 3) {
				if (g[i][j] == '0') cnt ++ ; else cnt = 0; if (!cnt) continue;
				ans = (ans + s[i][j] * (suf[i][j] - 1) % mod * (cnt - 1) % mod) % mod;
			}
		} return (ans % mod + mod) % mod;
	};
	printf("%lld %lld\n", c * calc_C() % mod, f * calc_F() % mod);
}
signed main() {
	read(T, id);
	while (T -- ) sub();
	return 0;
}