import itertools
from functools import cache
import sys
sys.setrecursionlimit(10 ** 9)
import math
from collections import Counter, deque
input = lambda: sys.stdin.readline().rstrip()
mod = 998244353

h, w = map(int, input().split())
a, b = map(int, input().split())
a -= 1
b -= 1
r1, c1, r2, c2 = map(int, input().split())
r1 -= 1
c1 -= 1
r2 -= 1
c2 -= 1
p, q = map(int, input().split())
p -= 1
q -= 1

ans = 10 ** 10
ret = abs(p - a) + abs(q - b)
for nowr in range(r1, r2 + 1):
    for nowc in range(c1, c2 + 1):
        approach = abs(a - nowr) + abs(b - nowc)
        dispose = abs(nowr - p) + abs(nowc - q)
        ans = min(ans, approach + dispose + ret)
print(ans)