#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include using namespace std; using std::cin; using std::cout; #define rep(i,n) for(int i = 0; i < (int)n; i++) #define FOR(n) for(int i = 0; i < (int)n; i++) #define repi(i,a,b) for(int i = (int)a; i < (int)b; i++) #define all(x) x.begin(),x.end() //#define mp make_pair #define vi vector #define vvi vector #define vvvi vector #define vvvvi vector #define pii pair #define vpii vector> template bool chmax(T &a, const T b) {if(a bool chmin(T &a, const T b) {if(a>b) {a=b; return true;} else {return false;}} using ll = long long; using ld = long double; using ull = unsigned long long; const ll INF = numeric_limits::max() / 2; const ld pi = 3.1415926535897932384626433832795028; const ll mod = 998244353; int dx[] = {1, 0, -1, 0, -1, -1, 1, 1}; int dy[] = {0, 1, 0, -1, -1, 1, -1, 1}; #define int long long void solve() { // パス以外で隣接するのがダメ int h, w; cin >> h >> w; int sx, sy, gx, gy; cin >> sx >> sy >> gx >> gy; sx--; sy--; gx--; gy--; set st; int ans = 0; auto dfs = [&](int x, int y, int px, int py, auto self) -> void { rep(d, 4) { int nx = x + dx[d]; int ny = y + dy[d]; if(nx < 0 || nx >= h || ny < 0 || ny >= w) continue; if(nx == px && ny == py) continue; if(st.find(make_pair(nx, ny)) != st.end()) return; } if(x == gx && y == gy) { ans++; return; } st.emplace(x, y); rep(d, 4) { int nx = x + dx[d]; int ny = y + dy[d]; if(nx < 0 || nx >= h || ny < 0 || ny >= w) continue; if(nx == px && ny == py) continue; self(nx, ny, x, y, self); } st.erase(st.find(make_pair(x, y))); }; dfs(sx, sy, -1, -1, dfs); cout << ans << endl; } signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); solve(); return 0; }