Go: package main

import (
	"fmt"
	"math"
)

type Position struct {
	X int64
	Y int64
}

func (one Position) Distance(another Position) int64 {
	return int64(math.Abs(float64(one.X-another.X)) + math.Abs(float64(one.Y-another.Y)))
}

type PersonPosition struct {
	Takayuki Position
	Kazuyuki Position
}

func (one PersonPosition) Distance() int64 {
	return one.Takayuki.Distance(one.Kazuyuki)
}

type Status struct {
	Person PersonPosition
	Turn   int64
}

type PQStatus []*Status

func solve(h, w int64) {
	var tx, ty, kx, ky int64
	fmt.Scan(&tx, &ty, &kx, &ky)
	tx--
	ty--
	kx--
	ky--
	m := make([][]int64, h)
	for i := range m {
		m[i] = make([]int64, w)
		for j := int64(0); j < w; j++ {
			fmt.Scan(&m[i][j])
		}
	}
	start := &Status{Person: PersonPosition{Takayuki: Position{X: tx, Y: ty}, Kazuyuki: Position{X: kx, Y: ky}}, Turn: 0}
	pq := make(PQStatus, 0)
	pq = append(pq, start)
	dx := []int64{0, 1, 0, -1}
	dy := []int64{1, 0, -1, 0}
	memo := make(map[PersonPosition]int64, 0)
	ans := int64(102)
	for len(pq) > 0 {
		now := pq[0]
		pq = pq[1:]
		if now.Person.Distance() == 0 && ans > now.Turn {
			ans = now.Turn
		}
		if ans <= now.Turn {
			continue
		}

		if _, ok := memo[now.Person]; ok {
			continue
		}
		memo[now.Person] = now.Turn

		for i := 0; i < 4; i++ {
			next := &Status{}
			*next = *now
			next.Person.Kazuyuki.X += dx[i]
			next.Person.Kazuyuki.Y += dy[i]
			if next.Person.Kazuyuki.X < 0 || next.Person.Kazuyuki.X >= w ||
				next.Person.Kazuyuki.Y < 0 || next.Person.Kazuyuki.Y >= h ||
				m[next.Person.Kazuyuki.Y][next.Person.Kazuyuki.X] == 1 {
				next.Person.Kazuyuki.X -= dx[i]
				next.Person.Kazuyuki.Y -= dy[i]
			}
			next.Person.Takayuki.X -= dx[i]
			next.Person.Takayuki.Y -= dy[i]
			if next.Person.Takayuki.X < 0 || next.Person.Takayuki.X >= w ||
				next.Person.Takayuki.Y < 0 || next.Person.Takayuki.Y >= h ||
				m[next.Person.Takayuki.Y][next.Person.Takayuki.X] == 1 {
				next.Person.Takayuki.X += dx[i]
				next.Person.Takayuki.Y += dy[i]
			}
			next.Turn++
			if next.Turn <= 100 {
				pq = append(pq, next)
			}
		}
	}
	if ans == 102 {
		fmt.Println("NA")
	} else {
		fmt.Println(ans)
	}
}

func main() {
	var h, w int64
	for {
		fmt.Scan(&h, &w)
		if h == 0 && w == 0 {
			break
		}
		solve(h, w)
	}
}

C++: #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef pair<int, int>P;
typedef pair<P, P>PP;

int dx[]{ 1,-1,0,0 }, dy[]{ 0,0,1,-1 };
int mp[70][70];
int main() {
	int X, Y;
	while (scanf("%d%d", &X, &Y), X) {
		int tx, ty; scanf("%d%d", &tx, &ty); tx--; ty--;
		int kx, ky; scanf("%d%d", &kx, &ky); kx--; ky--;
		rep(i, Y)rep(j, X)scanf("%d", &mp[i][j]);
		map<PP, int>cnt;
		queue<PP>que;
		cnt[{ {tx, ty}, { kx,ky }}] = 1;
		que.push({ {tx,ty},{kx,ky} });
		while (!que.empty()) {
			PP p = que.front(); que.pop();
			if (p.first == p.second) {
				printf("%d\n", cnt[p] - 1);
				goto goal;
			}
			if (cnt[p] >= 100)continue;
			rep(i, 4) {
				rep(j, 4) {
					int tnx = p.first.first + dx[i];
					int tny = p.first.second + dy[i];
					int knx = p.second.first - dx[i];
					int kny = p.second.second - dy[i];
					if (tnx < 0 || tnx >= X || tny < 0 || tny >= Y || mp[tnx][tny]) {
						tnx = p.first.first;
						tny = p.first.second;
					}
					if (knx < 0 || knx >= X || kny < 0 || kny >= Y || mp[knx][kny]) {
						knx = p.second.first;
						kny = p.second.second;
					}
					if (!cnt[{ {tnx, tny}, { knx,kny }}]) {
						cnt[{ {tnx, tny}, { knx,kny }}] = cnt[p] + 1;
						que.push({ { tnx, tny },{ knx,kny } });
					}
				}
			}
		}
		puts("NA");
	goal:;
	}
}