#include <iostream>
using namespace std;

const int N = 10;
int n, m, x, y;

bool st[N][N];

int dx[8] = {-2, -1, 1, 2, 2, 1, -1, -2};

int dy[8] = {1, 2, 2, 1, -1, -2, -2, -1};
int ans;

void dfs(int cx, int cy, int step) {
if (step == n * m) {
ans++;
return;
}

for (int i = 0; i < 8; i++) {
int newX = cx + dx[i];
int newY = cy + dy[i];
if (newX >= 0 && newX < n && newY >= 0 && newY < m &&!st[newX][newY]) {
st[newX][newY] = true;
dfs(newX, newY, step + 1);
st[newX][newY] = false;
}
}
}

int main() {
int T;
cin >> T;
while (T--) {
cin >> n >> m >> x >> y;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
st[i][j] = false;
}
}
ans = 0;
st[x][y] = true;
dfs(x, y, 1);
cout << ans << endl;
}
return 0;
}

666