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 <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <ctime>
#define INF 999999999
#define mod 1000000007
 
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=(n);i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
 
//int dx[4]={1,0,-1,0};
//int dy[4]={0,1,0,-1};

bool debug=false;
/*---------------------------------------------------*/

int w,h;
int maze[35][35];
int ans[35][35];



void Debug(){

  cout<<endl;
  rep(i,h*2-1){
    rep(j,w)cout<<maze[i][j]<<" ";
    cout<<endl;
    }
  cout<<endl;
  rep(i,h){
    rep(j,w)cout<<ans[i][j]<<" ";
    cout<<endl;
  }
}

void init(){
  rep(i,35)rep(j,35){ans[i][j]=0;maze[i][j]=0;}
  ans[0][0]=1;
}

void bfs(){
  queue<int> que;
  que.push(0);que.push(0);
  while(que.size()){
    int x=que.front();que.pop();
    int y=que.front();que.pop();
    //down
    if(!maze[y*2+1][x]&&y+1<h){
      maze[y*2+1][x]=1;
      ans[y+1][x]=1+ans[y][x];
      que.push(x);que.push(y+1);
    }
    if(!maze[y*2][x]&&x+1<w){
      maze[y*2][x]=1;
      ans[y][x+1]=1+ans[y][x];
      que.push(x+1);que.push(y);
    }
    if(!maze[(y-1)*2+1][x]&&0<=y-1){
      maze[(y-1)*2+1][x]=1;
      ans[y-1][x]=1+ans[y][x];
      que.push(x);que.push(y-1);
    }
  }
  //Debug();
  if(ans[h-1][w-1])cout<<ans[h-1][w-1]<<endl;
  else cout<<0<<endl;
}

int main(){
  while(cin>>w>>h){
    if(w==0&&h==0)break;
    init();
    rep(i,h*2-1){
      rep(j,w){
	if(i%2==0){
	  if(j==w-1)maze[i][j]=1;
	  else cin>>maze[i][j];
	}else{
	  cin>>maze[i][j];
	}
      }
    }
    bfs();
  }
}

C++: #include<stdio.h>
#include<string.h>
#include<utility>
#include<iostream>
#include<queue>

using namespace std;
typedef long long ll;
 
#define REP(i,n) for(int i=0;i<(int)(n);i++)
 
typedef struct zah{
    int y;
    int x;
    int dist;
} zah;
 
int main()
{
    int w,h;
    int ban[35][35];
    int dist[35][35];
    int kabe;
    int dx[4]={1,0,-1,0};
    int dy[4]={0,1,0,-1};
    int dc[4]={3,5,7,2};
    while(1==1)
    {
        scanf("%d %d\n",&w,&h);
        if(w==0&&h==0)return 0;
        REP(i,35)REP(j,35)ban[i][j]=1;
        REP(i,35)REP(j,35)dist[i][j]=10000;
        REP(i,w)
        {
            ban[0][i]*=2;
            ban[h-1][i]*=5;
        }
        REP(j,h)
        {
            ban[j][0]*=7;
            ban[j][w-1]*=3;
        }
        REP(i,2*h-1)
        {
            if(i%2==0)
            {
                REP(j,w-1)
                {
                   scanf("%d",&kabe);
                   if(kabe==1)
                   {
                       ban[i/2][j]*=3;
                       ban[i/2][j+1]*=7;
                   } 
                }
            }
            else
            {
                REP(j,w)
                {
                    scanf("%d",&kabe);
                    if(kabe==1)
                    {
                        ban[i/2][j]*=5;
                        ban[(i+1)/2][j]*=2;
                    }
                }
            }
        }
        queue<zah> que;
        while(!que.empty())que.pop();
        zah za;
        zah zapush;
        za.x=0;
        za.y=0;
        za.dist=1;
        que.push(za);
        //printf("push (%d,%d):dist%d\n",za.y,za.x,za.dist);
        int wall;
        while(!que.empty())
        {
            za=que.front();
            que.pop();
            if(za.y==h-1&&za.x==w-1)
            {
                printf("%d\n",za.dist);
                break;
            }
            dist[za.y][za.x]=za.dist;
            wall=ban[za.y][za.x];
            REP(i,4)
            {
                if(wall%dc[i]!=0)
                {
                    //printf("$$$%d$$$\n",i);
                    if(dist[za.y+dy[i]][za.x+dx[i]]==10000)
                    {
                        //printf("jpge\n");
                        dist[za.y+dy[i]][za.x+dx[i]]=za.dist+1;
                        zapush.y=za.y+dy[i];
                        zapush.x=za.x+dx[i];
                        zapush.dist=za.dist+1;
                        que.push(zapush);
                        //printf("push (%d,%d):dist%d\n",zapush.y,zapush.x,zapush.dist);
                    }
                }
            }
        }
        if(!(za.y==h-1&&za.x==w-1))printf("0\n");
    }
    return 0;
}