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 <queue>
using namespace std;

static const int inf = 1000;

struct node{
  int x;
  int y;
};



int hor[36][36] = {{}};
int vir[36][36] = {{}};
int d[36][36] ;
int h,w,a = 0,b;

void bfs(int r,int s){

  queue <node> q;
  node locate; 
  node u,t;

  locate.y = r;
  locate.x = s;

  // cout << "lx = " << locate.x << ' ' << "ly = " << locate.y << endl;

  for(int i = 0;i < h;i++){
    for(int j = 0;j < w;j++){
      d[i][j] = inf;
    }
  }

  q.push(locate);

  d[0][0] = 1;

  while(!q.empty()){
    u = q.front(); q.pop();
    a++;
    if(hor[u.y][u.x] != 1 && u.y < h - 1  && (d[u.y][u.x] + 1 < d[u.y + 1][u.x])){
      d[u.y + 1][u.x] = d[u.y][u.x] + 1;
      t.x = u.x;
      t.y = u.y + 1; 
      q.push(t);
     
    }
    if(vir[u.y][u.x] != 1 && u.x < w - 1 && (d[u.y][u.x] + 1 < d[u.y][u.x + 1])){
      d[u.y][u.x + 1] = d[u.y][u.x] + 1;
      t.y = u.y;
      t.x = u.x + 1;
      q.push(t);
    }

    if((hor[u.y - 1][u.x] != 1) &&( u.y > 0 )/*&& (d[u.y][u.x] + 1 <  d[u.y - 1][u.x]) && (( vir[u.y][u.x] == 1) ||( hor[u.y][u.x] == 1))*/){
      d[u.y - 1][u.x] = d[u.y][u.x] + 1;
      t.x = u.x;
      t.y = u.y - 1; 
      q.push(t);
     
    }

    if((vir[u.y][u.x - 1] != 1) &&( u.x > 0 ) && (d[u.y][u.x] + 1 < d[u.y][u.x - 1]) && (( vir[u.y][u.x] == 1) ||( hor[u.y][u.x] == 1))){
      d[u.y][u.x - 1] = d[u.y][u.x] + 1;
      t.y = u.y;
      t.x = u.x - 1;
      q.push(t);
    }

    //   cout << "x = " << u.x << ' ' << "y = " << u.y << endl;
   
  }
}


int main(){

  while(1){
    cin >> w >> h;

    // cout << " w = " << w << ' ' << "h = " << h << endl; 
    if(w == 0 && h == 0) break;

    for(int i = 0;i < h - 1;i++){
      for(int j = 0;j < w - 1;j++) cin >> vir[i][j];
      for(int j = 0;j < w ;j++) cin >> hor[i][j];
    }

    for(int j = 0;j < w - 1;j++) cin >> vir[h - 1][j];

   

    bfs(0,0);
    // cout << "a = " << a << endl;

    if(d[h - 1][w - 1] != 1000) cout  << d[h - 1][w - 1] << endl;
    else cout << '0' << endl;

    for(int i = 0;i < 36;i++){
      for(int j = 0;j < 36;j++){
	vir[i][j] = 0;
	hor[i][j] = 0;
	d[i][j] = 0;
      }
    }
    a = 0;
  }
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include <time.h>
#include <tuple>
#include <iomanip>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e12;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define rep(i,N) for(ll i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1

ll sq(ll num) { return num*num; }
ll mod_pow(ll x, ll n) {
	if (n == 0)return 1;
	if (n == 1)return x%MOD;
	ll res = sq(mod_pow(x, n / 2));
	res %= MOD;
	if (n % 2 == 1) {
		res *= x;
		res %= MOD;
	}
	return res;
}
ll mod_add(ll a, ll b) { return (a + b) % MOD; }
ll mod_sub(ll a, ll b) { return (a - b + MOD) % MOD; }
ll mod_mul(ll a, ll b) { return a*b % MOD; }

ll h, w;
ll table[100][100];

ll d[100][100];
ll dx[4] = { 0,1,0,-1 };
ll dy[4] = { 1,0,-1,0 };

void solve() {
	queue<P> que;

	que.push({ 0,0 });
	rep(i, 100)rep(j, 100)d[i][j] = INF;
	d[0][0] = 1;

	while (que.size()) {
		P p = que.front();
		ll y = p.first;
		ll x = p.second;
		que.pop();
		rep(i, 4) {
			ll nx = x + dx[i];
			ll ny = y + dy[i];
			if (ny >= 0 && ny < 2 * h - 1 && nx >= 0 && nx < 2 * w - 1) {
				if (table[ny][nx] == 0) {
					if (d[ny + dy[i]][nx + dx[i]] > d[y][x]) {
						d[ny + dy[i]][nx + dx[i]] = d[y][x] + 1;
						que.push({ ny + dy[i],nx + dx[i] });
					}
				}
			}
		}
	}
}

int main() {
	while (cin >> w >> h&&h + w) {
		rep(i, 2 * h - 1) {
			rep(j, 2 * w - 1) {
				if ((i + j) % 2)cin >> table[i][j];
				else table[i][j] = 2;
			}
		}
		solve();
		//rep(i, 2 * h - 1) {
		//	rep(j, 2 * w - 1) {
		//		if(d[i][j]!=INF)cout << d[i][j] << " ";
		//		else cout << -1 << " ";
		//	}
		//	cout << endl;
		//}
		if (d[2 * h - 2][2 * w - 2] == INF)cout << 0 << endl;
		else cout << d[2 * h - 2][2 * w - 2] << endl;
	}
}