Go: package main

import (
	"bufio"
	"container/list"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	io := NewIo()
	defer io.Flush()
	for {
		w, h := io.NextInt(), io.NextInt()
		if w == 0 {
			break
		}
		xWall := make([][]int, h)
		yWall := make([][]int, h)
		for i := 0; i < h; i++ {
			xWall[i], yWall[i] = make([]int, w), make([]int, w)
			for j := 0; j < w; j++ {
				xWall[i][j], yWall[i][j] = -1, -1
			}
		}
		for i := 0; i < h*2-1; i++ {
			if i%2 == 0 {
				for j := 0; j < w-1; j++ {
					xWall[i/2][j] = io.NextInt()
				}
			} else {
				for j := 0; j < w; j++ {
					yWall[i/2][j] = io.NextInt()
				}
			}
		}
		//io.Println(bfs(w, h, xWall, yWall))
		fmt.Println(bfs(w, h, xWall, yWall))
	}
}

type P struct {
	x, y int
}

func bfs(w, h int, x, y [][]int) int {
	d := make([][]int, h)
	for i := 0; i < h; i++ {
		d[i] = make([]int, w)
	}
	q := list.New()
	q.PushBack(P{0, 0})
	d[0][0] = 1

	for q.Len() != 0 {
		pos := q.Remove(q.Front()).(P)
		if pos.x == w-1 && pos.y == h-1 {
			break
		}
		if pos.x > 0 && x[pos.y][pos.x-1] == 0 && d[pos.y][pos.x-1] == 0 {
			d[pos.y][pos.x-1] = d[pos.y][pos.x] + 1
			q.PushBack(P{pos.x - 1, pos.y})
		}
		if pos.x < w-1 && x[pos.y][pos.x] == 0 && d[pos.y][pos.x+1] == 0 {
			d[pos.y][pos.x+1] = d[pos.y][pos.x] + 1
			q.PushBack(P{pos.x + 1, pos.y})
		}
		if pos.y > 0 && y[pos.y-1][pos.x] == 0 && d[pos.y-1][pos.x] == 0 {
			d[pos.y-1][pos.x] = d[pos.y][pos.x] + 1
			q.PushBack(P{pos.x, pos.y - 1})
		}
		if pos.y < h-1 && y[pos.y][pos.x] == 0 && d[pos.y+1][pos.x] == 0 {
			d[pos.y+1][pos.x] = d[pos.y][pos.x] + 1
			q.PushBack(P{pos.x, pos.y + 1})
		}
	}
	return d[h-1][w-1]
}

// I/O template
type Io struct {
	reader    *bufio.Reader
	writer    *bufio.Writer
	tokens    []string
	nextToken int
}

func NewIo() *Io {
	return &Io{
		reader: bufio.NewReader(os.Stdin),
		writer: bufio.NewWriter(os.Stdout),
	}
}

func (io *Io) Flush() {
	err := io.writer.Flush()
	if err != nil {
		panic(err)
	}
}

func (io *Io) NextLine() string {
	var buff []byte
	for {
		line, isPrefix, err := io.reader.ReadLine()
		if err != nil {
			panic(err)
		}
		buff = append(buff, line...)
		if !isPrefix {
			break
		}
	}
	return string(buff)
}

func (io *Io) Next() string {
	for io.nextToken >= len(io.tokens) {
		line := io.NextLine()
		io.tokens = strings.Fields(line)
		io.nextToken = 0
	}
	s := io.tokens[io.nextToken]
	io.nextToken++
	return s
}

func (io *Io) NextInt() int {
	i, err := strconv.Atoi(io.Next())
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) NextFloat() float64 {
	i, err := strconv.ParseFloat(io.Next(), 64)
	if err != nil {
		panic(err)
	}
	return i
}

func (io *Io) Println(a ...interface{}) {
	fmt.Fprintln(io.writer, a...)
}

func (io *Io) Printf(format string, a ...interface{}) {
	fmt.Fprintf(io.writer, format, a...)
}

func (io *Io) PrintIntSlice(a []int) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func (io *Io) PrintStringSlice(a []string) {
	b := []interface{}{}
	for _, x := range a {
		b = append(b, x)
	}
	io.Println(b...)
}

func Log(name string, value interface{}) {
	fmt.Fprintf(os.Stderr, "%s=%+v\n", name, value)
}

func ExampleIo() {
	io := NewIo()
	defer io.Flush()
	a := make([]int, 0, 3)
	a[0], a[1], a[2] = io.NextInt(), io.NextInt(), io.NextInt()
	io.Println(a)
	io.PrintIntSlice(a)
	Log("io", a)
}

Python: def bfs(maze):
    d = [[0] * 70 for i in range(70)]
    d[1][1] = 1
    que = [(1, 1)]
    while 0 < len(que):
        new_que = []
        for x, y in que:
            if x == 2 * w - 1 and y == 2 * h - 1:
                return d[y][x]
            for dx, dy in ((0, 1), (-1, 0), (0, -1), (1, 0)):
                mx, my = x + dx, y + dy
                nx, ny = mx + dx, my + dy
                if nx < 0 and w < nx and ny < 0 and h < ny:
                    continue
                if maze[my][mx] == 0 and d[ny][nx] == 0:
                    new_que.append((nx, ny))
                    d[ny][nx] = d[y][x] + 1
        que = new_que
    return 0

while True:
    w, h = map(int, input().split())
    maze = [[0] * (w * 2 + 1) for i in range(h * 2 + 1)]
    if w == h == 0:
        break
    for x in range(w * 2 + 1):
        maze[0][x] = maze[h * 2][x] = 1
    for y in range(h * 2 + 1):
        maze[y][0] = maze[y][w * 2] = 1

    for y in range(1, h * 2):
        a = [int(i) for i in input().split()]
        if y % 2 == 1:
            for x in range(w - 1):
                maze[y][2 * x + 2] = a[x]
        else:
            for x in range(w):
                maze[y][2 * x + 1] = a[x]

    print(bfs(maze))

Python: while 1:
    w,h=map(int,input().split())
    if w==h==0:break
    maze,wall=[[float("inf") for i in range(w)] for j in range(h)],[]
    maze[0][0]=1
    for i in range(2*h-1):wall.append(list(map(int,input().split())))
    flag=0
    step=0
    while 1:
        if flag==1:break
        flag=1
        step+=1
        for i in range(w):
            for j in range(h):
                if maze[j][i]==step:
                    if i-1>=0 and wall[j*2][i-1]==0 and maze[j][i-1]>step+1:
                        maze[j][i-1],flag=step+1,0
                    if i+1<w and wall[j*2][i]==0 and maze[j][i+1]>step+1:
                        maze[j][i+1],flag=step+1,0
                    if j-1>=0 and wall[j*2-1][i]==0 and maze[j-1][i]>step+1:
                        maze[j-1][i],flag=step+1,0
                    if j+1<h and wall[j*2+1][i]==0 and maze[j+1][i]>step+1:
                        maze[j+1][i],flag=step+1,0
        if maze[-1][-1]!=float("inf"):break
    if maze[-1][-1]==float("inf"):print(0)
    else:print(maze[-1][-1])

Python: def bfs(maze):
    d = [[0] * 70 for i in range(70)]
    d[1][1] = 1
    que = [(1, 1)]
    while 0 < len(que):
        new_que = []
        for x, y in que:
            if x == 2 * w - 1 and y == 2 * h - 1:
                return d[y][x]
            for dx, dy in ((0, 1), (-1, 0), (0, -1), (1, 0)):
                mx, my = x + dx, y + dy
                nx, ny = mx + dx, my + dy
                if nx < 0 and w < nx and ny < 0 and h < ny:
                    continue
                if maze[my][mx] == 0 and d[ny][nx] == 0:
                    new_que.append((nx, ny))
                    d[ny][nx] = d[y][x] + 1
        que = new_que
    return 0

while True:
    w, h = map(int, input().split())
    maze = [[0] * (w * 2) for i in range(h * 2)]
    if w == h == 0:
        break
    for x in range(w * 2 + 1):
        maze[0][x] = maze[h * 2][x] = 1
    for y in range(h * 2 + 1):
        maze[y][0] = maze[y][w * 2] = 1

    for y in range(1, h * 2):
        a = [int(i) for i in input().split()]
        if y % 2 == 1:
            for x in range(w - 1):
                maze[y][2 * x + 2] = a[x]
        else:
            for x in range(w):
                maze[y][2 * x + 1] = a[x]

    print(bfs(maze))