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 <iomanip>
#include <cmath>
#include <queue>

#define MAX_W 30
#define MAX_H 30

using namespace std;

const int INF = 100000000;

typedef pair<int, int> P;

int W, H;
int maze[MAX_W][2*MAX_H-1];

int d[MAX_W][MAX_H]; //???????????§??????????????¢

int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

int bfs(){
	queue<P> que;

	for(int i = 0; i < W; i++){
		for(int j = 0; j < H; j++){
			d[i][j] = INF;
		}
	}
	que.push(P(0, 0));
	d[0][0] = 1;

	while(que.size()){
		P p = que.front(); que.pop();
		if(p.first == W-1 && p.second == H-1) break;
		for(int i = 0; i < 4; i++){
			int nx = p.first + dx[i], ny = p.second + dy[i];
			if(dx[i] == 0){ // ????§????
				if(0 <= ny && ny < H && maze[p.first][2*p.second+1] != 1 && d[nx][ny] == INF){
					que.push(P(nx, ny));
					d[nx][ny] = d[p.first][p.second]+1;
				}
			}else{ // ?¨??§????
				if(0 <= nx && nx < W && maze[p.first][2*p.second] != 1 && d[nx][ny] == INF){
					que.push(P(nx, ny));
					d[nx][ny] = d[p.first][p.second]+1;
				}
			}
		}
	}
	return d[W-1][H-1];
}

void solve() {
	int res = bfs();
	if(res != INF) cout << res << endl;
	else cout << 0 << endl;
}

int main(){

	while(true){
		cin >> W >> H;
		if(W == 0 && H == 0) break;
		for(int i = 0; i < 2*H-1; i++){
			for(int j = 0; j < W-1+(i%2); j++){
				cin >> maze[j][i];
			}
		}
		solve();
	}
	return 0;
}

C++: #include<iostream>
using namesapce std;

int main(){
cout << "Hello World" << endl;
}

C++: #include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define P pair<int, int>
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
//#define int long long
const int MAX_H = 35;
const int MAX_W = 35;
const int INF = 1e9 + 10;

int W, H;
bool v[MAX_H][MAX_W][4];
int my[] = {-1, 0, 1, 0};
int mx[] = {0, 1, 0, -1};

class C{
  public:
    int y, x, c;
    C(int _y, int _x, int _c){ y = _y; x = _x; c = _c; };
    C(){}
};

int main() {
  while(cin >>W >>H && H){
    REP(i, MAX_H) REP(j, MAX_W) REP(k, 4) v[i][j][k] = true;
    REP(i, H) v[i][0][3] = v[i][W - 1][1] = false;
    REP(i, W) v[0][i][0] = v[H - 1][i][2] = false;
    string s;
    getline(cin, s);
    REP(z, 2 * H - 1){
      getline(cin, s);
      if(z % 2){
        for(int i = 0; i < (int)(s.length()); i += 2){
          if(s[i] == '1'){
            v[z / 2][i / 2][2] = false;
            v[(z + 1) / 2][i / 2][0] = false;
          }
        }
      } else{
        for(int i = 1; i < (int)(s.length()); i += 2){
          if(s[i] == '1'){
            v[z / 2][i / 2][1] = false;
            v[z / 2][(i + 1) / 2][3] = false;
          }
        }
      }
    }
    //debug
    //cout <<"-------" <<endl;
    //REP(i, H){
    //  REP(j, W){
    //    cout <<i <<", " <<j <<" | ";
    //    REP(k, 4) cout <<v[i][j][k] <<" ";
    //    cout <<endl;
    //  }
    //}

    queue<C> open;
    open.push(C(0, 0, 1));
    int closed[MAX_H][MAX_W];
    REP(i, MAX_H) REP(j, MAX_W) closed[i][j] = INF;
    while(!open.empty()){
      C now = open.front(); open.pop();
      int y = now.y, x = now.x, c = now.c;
      if(closed[y][x] <= c) continue;
      closed[y][x] = c;
      REP(i, 4) if(v[y][x][i]) open.push(C(y + my[i], x + mx[i], c + 1));
    }
    cout <<(closed[H - 1][W - 1] == INF ? 0 : closed[H - 1][W - 1]) <<endl;
  }
  return 0;
}