#include <bits/stdc++.h>
using namespace std;
const int P = 998244353; 

int n, m, VC, VF, C, F;   
char a[5005][5005];
int rig[5005][5005], up[5005][5005], down[5005][5005]; 

int main(void) {
    int T, id; scanf("%d%d", &T, &id);
    while (T--) {
        memset(rig, 0, sizeof rig); memset(up, 0, sizeof up); memset(down, 0, sizeof down);
        scanf("%d%d%d%d", &n, &m, &VC, &VF);
        for (int i = 1; i <= n; ++i) scanf("%s", a[i] + 1); 
        for (int i = n; i >= 1; --i) {
            rig[i][m] = (a[i][m] == '0' ? 1 : 0);
            for (int j = m - 1; j >= 1; --j) {
                if (a[i][j] == '1') rig[i][j] = 0; 
                else rig[i][j] = (rig[i][j + 1] + 1) % P; 
            }
        }
        for (int i = 2; i <= n; ++i)
            for (int j = 1; j <= m; ++j) {
                if (a[i][j] == '1') up[i][j] = 0; 
                else {
                    up[i][j] = up[i - 1][j]; 
                    if (a[i - 1][j] != '1') up[i][j] = (up[i][j] + rig[i - 1][j + 1]) % P; 
                }
            }
        for (int j = 1; j <= m; ++j) {
            down[n][j] = (a[n][j] == '0' ? 1 : 0);
            for (int i = n - 1; i >= 1; --i) {
                if (a[i][j] == '1') down[i][j] = 0; 
                else down[i][j] = (down[i + 1][j] + 1) % P; 
            }
        }
        C = F = 0; 
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= m; ++j) if (a[i][j] != '1') {
                C = (C + 1ll * up[i - 1][j] * (rig[i][j] - 1) % P) % P; 
                F = (F + 1ll * up[i - 1][j] * (rig[i][j] - 1) % P * down[i + 1][j] % P) % P;
            }
        printf("%lld %lld\n", 1ll * C * VC, 1ll * F * VF);
    } 
    return 0;
}