import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
# md = 998244353

def dfs(i,j,pi=-1,pj=-1):
    for di, dj in dij:
        ni, nj = i+di, j+dj
        if ni < 0 or nj < 0 or ni >= h or nj >= w: continue
        if ni==pi and nj==pj:continue
        if t[ni][nj]:return 0
    if (i,j)==(gi,gj):return 1
    res=0
    t[i][j]=1
    for di, dj in dij:
        ni, nj = i+di, j+dj
        if ni < 0 or nj < 0 or ni >= h or nj >= w: continue
        if ni==pi and nj==pj:continue
        res+=dfs(ni,nj,i,j)
    t[i][j]=0
    return res

h,w=LI()
t=[[0]*w for _ in range(h)]
si,sj=LI1()
gi,gj=LI1()
print(dfs(si,sj))