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)
}

C++: 
#include <iostream>
#include <vector>
#include <iterator>
#include <string>
#include <sstream>
#include <limits.h>

using namespace std;

string GetStr()
{
	string str;
	getline(cin,str);
	return str;
}

vector<int> GetIntVector()
{
	string str;
	getline(cin,str);
	istringstream line( str );

	istream_iterator<int> iit(line);
	istream_iterator<int> iit_eof;

	vector<int> ret;

	for(;iit != iit_eof; iit++){
		ret.push_back(*iit);
	}

	return ret;
}


typedef struct _Size
{
	int w,h;

	bool IsZero(){return w == 0 || h == 0;}

	
	static struct _Size GetSize()
	{
		struct _Size s;
		vector<int> vec = GetIntVector();
		s.w = vec[0];
		s.h = vec[1];
		return s;
	}

} Size;

void GoNextFloor(Size& s,vector<vector<int> >& vwhole,vector<vector<int> >& hwhole,vector<vector<int> >& floor,int x,int y,int step)
{
	floor[y][x] = step;
	if(y == s.h-1 && x == s.w-1) return ;

	step++;

	//ã
	if(y > 0 && hwhole[y-1][x] == 0 && floor[y-1][x] > step)
		GoNextFloor(s,vwhole,hwhole,floor,x,y-1,step);

	//º
	if(y < s.h - 1 && hwhole[y][x] == 0 && floor[y+1][x] > step)
		GoNextFloor(s,vwhole,hwhole,floor,x,y+1,step);

	//¶
	if(x > 0 && vwhole[y][x-1] == 0 && floor[y][x-1] > step)
		GoNextFloor(s,vwhole,hwhole,floor,x-1,y,step);

	//E
	if(x < s.w - 1 && vwhole[y][x] == 0 && floor[y][x+1] > step)
		GoNextFloor(s,vwhole,hwhole,floor,x+1,y,step);

	//SÄÌ×Ì°ðà¢½ÌÅAé
	return;
}

void EscapeMaze(Size& s)
{
	//cA¡ÌÇ(v,h)
	vector<vector<int> > vwhole,hwhole;

	vwhole.push_back(GetIntVector());
	for(int i = 0; i < s.h - 1; i++){
		hwhole.push_back(GetIntVector());
		vwhole.push_back(GetIntVector());
	}

	vector<vector<int> > floor(s.h);
	for(int i = 0; i < s.h; i++){
		floor[i].resize(s.w);
		for(int j = 0; j < s.w; j++){
			floor[i][j] = INT_MAX;
		}
	}

	GoNextFloor(s,vwhole,hwhole,floor,0,0,1);

	int ans = floor[s.h - 1][s.w - 1];
	ans = (ans == INT_MAX) ? 0 : ans;

	cout << ans << endl;
}

void B()
{
	Size size = Size::GetSize();
	while(!size.IsZero()){
		EscapeMaze(size);
		size = Size::GetSize();
	}
}

int main()
{
	B();

	return 0;
}

C++: #include<stdio.h>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<string>
#define pi 3.14159
#define Inf 9999
using namespace std;



int w, h, step, a[59][59];
void dfs(int y, int x);
int main(){
	while(1) {
		step = 1;
		cin >> w >> h;
		if(w == 0 && h == 0) break;
		for(int i = 0; i < 2*h-1; i++) {
			for(int j = 0; j < 2*w-1; j++) {
				if(i % 2 == 0 && j % 2 == 0) a[i][j] = Inf;
				else if(i % 2 == 1 && j % 2 == 1) a[i][j] = Inf;
				else cin >> a[i][j];
			}
		}
		a[0][0] = 1;
		if(a[1][0] == 0) dfs(2, 0);
		if(a[0][1] == 0) dfs(0, 2);
		if(a[2*h-2][2*w-2] == Inf) cout << 0 <<endl;
		else cout << a[2*h-2][2*w-2] <<endl;
		
	}
	return 0;
}

void dfs(int y, int x) {
	if(y < 0 || x < 0 || y >= 2*h-1 || x >= 2*w-1) return;
	if(step >= a[y][x]) return;
	else {
		step++;
		a[y][x] = step;
		if(y+1 < 2*h-2) { 
			if(a[y+1][x] == 0) dfs(y+2, x);
		}
		if(x + 1 < 2*w-2) {
			if(a[y][x+1] == 0) dfs(y, x+2);
		}
		if(y - 1 >= 0) {
			if(a[y-1][x] == 0) dfs(y-2, x);
		}
		if(x - 1 >= 0) {
			if(a[y][x-1] == 0) dfs(y, x-2);
		}
	}
	return;
}