#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
const int dx[4] = { 1,0,-1,0 };
const int dy[4] = { 0,-1,0,1 };
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int h, w; cin >> h >> w;
	int sx, sy, gx, gy;
	cin >> sx >> sy >> gx >> gy;
	sx--, sy--, gx--, gy--;
	int ans = 0;
	vector visit(h, vector<int>(w));
	auto in = [&](int x, int y)->bool {
		if (x < 0 || x >= h)return false;
		if (y < 0 || y >= w)return false;
		return true;
	};
	auto dfs = [&](auto &&self, int x, int y)->void {
		if (x == gx && y == gy) {
			ans++;
			return;
		}
		rep(i, 4) {
			int nx = x + dx[i];
			int ny = y + dy[i];
			if (!in(nx, ny))continue;
			if (visit[nx][ny])continue;
			rep(j, 4) {
				int nx = x + dx[j];
				int ny = y + dy[j];
				if (!in(nx, ny))continue;
				visit[nx][ny]++;
			}
			self(self, nx, ny);
			rep(j, 4) {
				int nx = x + dx[j];
				int ny = y + dy[j];
				if (!in(nx, ny))continue;
				visit[nx][ny]--;
			}
		}
	};
	visit[sx][sy] = 1;
	dfs(dfs, sx, sy);
	cout << ans << endl;
	return 0;
}