#include <bits/stdc++.h>
#define For(i, a, b) for(long long i = a; i < b; i++)
#define rep(i, n) For(i, 0, n)
#define rFor(i, a, b) for(long long i = a; i >= b; i--)
#define ALL(v) (v).begin(), (v).end()
#define rALL(v) (v).rbegin(), (v).rend()
using namespace std;

using lint = long long;
using ld = long double;

vector<int> di = {-1, 0, 1, 0};
vector<int> dj = {0, 1, 0, -1};

int main() {
    int h, w, si, sj, gi, gj;
    cin >> h >> w >> si >> sj >> gi >> gj;
    si--;
    sj--;
    gi--;
    gj--;
    auto inc = [&](int i, int j) {
        return (0 <= i && i < h && 0 <= j && j < w);
    };
    vector<vector<bool>> visit(h, vector<bool>(w, false));
    auto dfs = [&](auto dfs, int i, int j) -> int {
        if (i == gi && j == gj) {
            return 1;
        }
        int res = 0;
        rep(k, 4) {
            int ni = i + di[k], nj = j + dj[k];
            if (!inc(ni, nj) || visit[ni][nj]) {
                continue;
            }
            bool ok = true;
            rep(kk, 4) {
                int nni = ni + di[kk], nnj = nj + dj[kk];
                if (inc(nni, nnj) && !(nni == i && nnj == j) && visit[nni][nnj]) {
                    ok = false;
                }
            }
            if (ok) {
                visit[i][j] = true;
                res += dfs(dfs, ni, nj);
                visit[i][j] = false;
            }
        }
        return res;
    };
    cout << dfs(dfs, si, sj) << endl;
}