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: from collections import deque
ans = []
while True:
    W, H = map(int, input().split())
    if (W, H) == (0, 0): break
    tate = []
    yoko = []
    for i in range(2*H-1):
        if i%2 == 0:
            tate.append(list(map(int, input().split())))
        else:
            yoko.append(list(map(int, input().split())))
    q = deque()
    q.append((0, 0))
    dis = [[-1]*W for _ in range(H)]
    dis[0][0] = 1
    while q:
        h, w = q.popleft()
        for dw, dh in [[0, 1], [0, -1], [1, 0], [-1, 0]]:
            nw, nh = w+dw, h+dh
            if not (0 <= nw < W and 0 <= nh < H and dis[nh][nw] == -1): continue
            if dw != 0 and tate[h][(w+nw)//2] == 1: continue
            if dh != 0 and yoko[(h+nh)//2][w] == 1: continue
            dis[nh][nw] = dis[h][w]+1
            q.append((nh, nw))
    if dis[H-1][W-1] != -1:
        ans.append(dis[H-1][W-1])
    else:
        ans.append(0)
print(*ans, sep="\n")

Python: #!/usr/bin/env python3
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

def B():
    #4方向移動リスト
    ANS = []
    move = [[1, 0], [-1, 0], [0, 1], [0, -1]]
    while True:
        #wとhの受け取り
        w, h = LI()
        if w == h == 0:
            break
        #maze受け取り
        #入力された文字列を1行ずつリストに入れるのを2*h-1回
        field = SR(2 * h - 1)
        #チェック済みかどうかを判定するリスト
        check = [[True] * (2 * w - 1) for i in range(2 * h - 1)]
        #queueの性質を持つリスト
        next = deque()
        #スタート位置(0,0)
        next.append((0, 0))
        ans = 1
        flg = True#ゴールかどうかの判定フラグ

        while next and flg:#nextに要素あり、flg = true(ゴールでない)
            now = next#nowにnextのqueueリスト受け渡し
            next = deque()#nextは新しいqueueリストを持つ
            while now:#nowに要素あるなら
                x, y = now.pop()
                for mx, my in move:
                    nx, ny = x + mx, y + my#4方向に移動

                    if 0 <= nx < 2 * w - 1 and 0 <= ny < 2 * h - 1 and field[ny][nx] == '0' and check[ny+my][nx+mx]:#移動先が0かつもう一つ先がチェック済みでないなら
                            next.append((nx + mx, ny + my))#移動先のもう一つ先をnextのqueueにいれて
                            check[ny + my][nx + mx] = False#そこをチェック済みにする
                            if nx+mx == 2 * w - 2 and ny+my == 2 * h - 2:#ゴールなら
                                ANS.append(ans+1)#結果を出力
                                flg = False#ゴールした
                                next = deque()#空にしてwhile文から抜ける
                                now = deque()#上同様
                                break
            ans += 1
        if flg:#ゴールしなかった
            ANS.append(0)


    return ANS

if __name__ == '__main__':
    A = B()
    for i in range(len(A)):
        print(A[i])