#include<iostream>
#include<string.h>
using namespace std;
int book[15][15];
int dir[8][2]={{1,2},{2,1},{2,-1},{1,-2},{-1,-2},{-2,-1},{-2,1},{-1,2}};
int n,m,x,y;
int sum=0;
void dfs(int a,int b,int s){
int p,q,k;
if(s==n*m){
sum++;
}
if(book[a][b]==0){
book[a][b]=1;
for(k=0;k<8;k++){
p=a+dir[k][0];
q=b+dir[k][1];
if(p>=n||p<0||q>=m||q<0)
continue;
if(book[p][q]==1)
continue;
dfs(p,q,s+1);
}
book[a][b]=0;
}
return ;
}
int main(){
int t;
cin>>t;
while(t--){
cin>>n>>m>>x>>y;
sum=0;
memset(book,0,sizeof(book));
dfs(x,y,1);
cout<<sum;
}
return 0;
}
