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 (pq PQStatus) Len() int {
	return len(pq)
}
func (pq PQStatus) Less(i, j int) bool {
	if pq[i].Turn == pq[j].Turn {
		return pq[i].Person.Distance() < pq[j].Person.Distance()
	}
	return pq[i].Turn < pq[j].Turn
}

func (pq PQStatus) Swap(i, j int) {
	pq[i], pq[j] = pq[j], pq[i]
}

func (pq *PQStatus) Push(x interface{}) {
	item := x.(*Status)
	*pq = append(*pq, item)
}

func (pq *PQStatus) Pop() interface{} {
	old := *pq
	n := len(old)
	item := old[n-1]
	*pq = old[0 : n-1]
	return item
}

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)
	//heap.Init(&pq)
	//heap.Push(&pq, start)
	//pq.Push(start)
	pq = append(pq, start)
	dx := []int64{0, 1, 0, -1}
	dy := []int64{1, 0, -1, 0}
	memo := make(map[PersonPosition]int64, 0)
	ans := int64(101)
	for pq.Len() > 0 {
		//now := heap.Pop(&pq).(*Status)
		//now := pq.Pop().(*Status)
		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 += 1
			if next.Turn <= 98 {
				//heap.Push(&pq, next)
				//pq.Push(next)
				pq = append(pq, next)
			}
		}
	}
	if ans == 101 {
		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 <iostream>
#include <algorithm>
#include <queue>
#include <utility>
#include <map>
using namespace std;

const int Y = 50, X = 50, guard = -1;
typedef pair<int, int> P;


int bfs(const int (*board)[Y + 2], P t, P k){
	int dx[] = {0, -1, 1, 0}, dy[] = {-1, 0, 0, 1};
	// pair<P, P> -> first = t, second = k
	queue<pair<P, P> > q;
	map<pair<P, P>, int> visited;
	q.push(make_pair(t, k));
	visited[make_pair(t, k)] = 0;
	while(!q.empty()){
		pair<P, P> picked = q.front();
		q.pop();
		if(visited[picked] >= 100) break;
		P ct = picked.first, ck = picked.second;
		if(ct.first == ck.first && ct.second == ck.second) return visited[picked];
		for(int i = 0;i < 4;++i){
			pair<P, P> nextp;
			P nextt, nextk;
			int tdx, tdy, kdx, kdy;
			tdx = dx[i]; tdy = dy[i];
			kdx = tdx * -1; kdy = tdy * -1;
			nextt = board[ct.first + tdx][ct.second + tdy] != guard ? make_pair(ct.first + tdx, ct.second + tdy) : ct;
			nextk = board[ck.first + kdx][ck.second + kdy] != guard ? make_pair(ck.first + kdx, ck.second + kdy) : ck;
			nextp = make_pair(nextt, nextk);
			if(visited[nextp] == 0 || visited[nextp] > visited[picked] + 1){
				q.push(nextp);
				visited[nextp] = visited[picked] + 1;
			}
		}
	}
	return -1;
}

int main(){
	int board[X + 2][Y + 2];
	int x, y, a, res;
	P t, k;
	while(cin >> x >> y, x && y){
		for(int i = 0;i <= X + 1;++i){
			fill(board[i], board[i] + (Y + 2), -1);
		}
		cin >> t.first >> t.second;
		cin >> k.first >> k.second;
		for(int i = 1;i <= y;++i){
			for(int j = 1;j <= x;++j){
				cin >> a;
				board[i][j] = -a;
			}
		}
		res = bfs(board, t, k);
		if(res != guard) cout << res << endl;
		else cout << "NA" << endl;
	}
	return 0;
}