import sys
import math

# 入力高速化
#input = sys.stdin.readline
# 再帰回数上限
sys.setrecursionlimit(10**9)

# よくあるmod
#MOD = 1000000007
MOD = 998244353

def is_inside(y, x, h, w):
  return (0 <= y < h and 0 <= x < w)

def solve():
    H, W = map(int, input().split(' '))
    A, B = map(int, input().split(' '))
    r1, c1, r2, c2 = map(int, input().split(' '))
    P, Q = map(int, input().split(' '))

    ans = 10**18
    for y in range(r1-1, r2):
        for x in range(c1-1, c2):
            dist = abs(A-1-y) + abs(B-1-x) + abs(y-P+1) + abs(x-Q+1) + abs(A-P) + abs(B-Q)
            ans = min(ans, dist)
    print(ans)
if __name__ == '__main__':
    T = 1
    for _ in range(T):
        solve()