#include <iostream>
#include <vector>
using namespace std;
const vector<int> dx4 = {0, 1, 0, -1};
const vector<int> dy4 = {1, 0, -1, 0};

int H, W;
int Si, Sj, Gi, Gj;
int count = 0;

bool valid(int i, int j) {
    if(!(0 <= i && i < H)) return false;
    if(!(0 <= j && j < W)) return false;
    return true;
}

void solve(int i, int j, vector<vector<bool>>& M) {
    
    if(i == Gi && j == Gj) {
        count++;
        return;
    }
    
    for(int k=0;k<4;k++) {
        int ni = i + dx4[k], nj = j + dy4[k];
        if(!valid(ni, nj)) continue;
        if(M[ni][nj]) continue;
        int neighbor = 0;
        for(int k_=0;k_<4;k_++) {
            int ni_ = ni + dx4[k_], nj_ = nj + dy4[k_];
            if(!valid(ni_, nj_)) continue;
            if(M[ni_][nj_]) neighbor++;
        }
        if(neighbor == 1) {
            M[ni][nj] = true;
            solve(ni, nj, M);
        }
        M[ni][nj] = false;
    }
}

int main() {

    pair<int, int> p1, p2;
    cin >> H >> W;
    cin >> Si >> Sj;
    cin >> Gi >> Gj;
    Si--;Sj--;Gi--;Gj--;
    p1 = {Si, Sj};
    p2 = {Gi, Gj};

    count = 0;
    vector<vector<bool>> M(H, vector<bool>(W, false));
    M[Si][Sj] = true;
    solve(Si, Sj, M);
    cout << count << endl;
}