#include<bits/stdc++.h>
using namespace std;

#include<atcoder/all>
using namespace atcoder;
using mint=atcoder::modint998244353;

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#define int long long

int di[]={-1,0,1,0};
int dj[]={0,-1,0,1};

signed main(){
	int h,w;cin>>h>>w;
	int si,sj;cin>>si>>sj;
	int gi,gj;cin>>gi>>gj;
	si--;sj--;
	gi--;gj--;

	auto dfs=[&](auto dfs,vector<pair<int,int>> vec)->int {
		if(vec.back()==pair<int,int>{gi,gj}){
			return 1;
		}

		
		auto[pi,pj]=vec.back();

		int ans=0;

		for(int i=0;i<4;i++){
			int ni=pi+di[i];
			int nj=pj+dj[i];

			if(0<=ni&&ni<h&&0<=nj&&nj<w){
				bool flg=0;

				vec.pop_back();

				for(auto&&e:vec){
					if(abs(e.first-ni)+abs(e.second-nj)==1){
						flg=1;
						break;
					}
				}

				vec.push_back({pi,pj});

				if(!flg){
					vec.push_back({ni,nj});
					ans+=dfs(dfs,vec);
					vec.pop_back();
				}
			}
		}

		return ans;
	};

	cout<<dfs(dfs,{{si,sj}})<<endl;
}