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

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

vector<ll> dx = {1, 0, -1, 0};
vector<ll> dy = {0, 1, 0, -1};

ll H, W;
ll si, sj, gi, gj;

void dfs(ll &ans, ll now_x, ll now_y, vector<vector<bool>> &used) {
    // debug_out(now_x, now_y);
    if (now_x == gi && now_y == gj) {
        ans++;
        // debug(used);
        return;
    }
    for (ll i = 0; i < 4; i++) {
        if (now_x + dx[i] >= 0 && now_x + dx[i] < H && now_y + dy[i] >= 0 &&
            now_y + dy[i] < W) {
            if (used[now_x + dx[i]][now_y + dy[i]]) {
                continue;
            }
            // その先のマス目が辿り着いてよいかどうか見る
            bool can_visit = true;
            ll nx = now_x + dx[i];
            ll ny = now_y + dy[i];
            for (ll j = 0; j < 4; j++) {
                if (abs(i - j) == 2) {
                    continue;
                }
                if (nx + dx[j] >= 0 && nx + dx[j] < H && ny + dy[j] >= 0 &&
                    ny + dy[j] < W) {
                    if (used[nx + dx[j]][ny + dy[j]]) {
                        can_visit = false;
                    }
                }
            }
            if (!can_visit) {
                continue;
            }
            used[nx][ny] = true;
            dfs(ans, nx, ny, used);
            used[nx][ny] = false;
        }
    }
}

int main() {
    cin >> H >> W;
    cin >> si >> sj;
    si--;
    sj--;
    cin >> gi >> gj;
    gi--;
    gj--;

    vector<vector<bool>> used(H, vector<bool>(W, false));
    ll now_x = si;
    ll now_y = sj;
    ll ans = 0;
    used[now_x][now_y] = true;
    dfs(ans, now_x, now_y, used);
    cout << ans << endl;
}