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
#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
// }}}

using namespace std;

typedef long long ll;
inline int in(){int x;scanf("%d",&x);return x;}

int way[999][999];

const int INF = 1 << 28;

int W, H;

struct Info {
  int x, y;
  int cost;
  Info(int x, int y, int cost) : x(x), y(y), cost(cost) {}
  bool operator<(const Info& rhs) const {
    return make_pair(x, y) < make_pair(rhs.x, rhs.y);
  }
  bool operator==(const Info& rhs) const {
    return make_pair(x, y) == make_pair(rhs.x, rhs.y);
  }
  int index() const {
    return y * W + x;
  }
  bool inBounds() const {
    return 0 <= x && x < W && 0 <= y && y < H;
  }
};

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

int bfs()
{
  const Info goal(W - 1, H - 1, -1);
  queue<Info> Q;
  Q.push(Info(0, 0, 1));
  set<Info> vis;
  while (!Q.empty()){
    queue<Info> nQ;
    while (!Q.empty()){
      auto& info = Q.front();
      Q.pop();
      if (info == goal) return info.cost;
      for (int d = 0; d < 4; d++){
        Info nxt = info;
        nxt.x += dx[d];
        nxt.y += dy[d];
        nxt.cost++;
        if (!nxt.inBounds()) continue;
        if (!way[info.index()][nxt.index()]) continue;
        if (vis.count(nxt)) continue;
        vis.insert(nxt);
        nQ.push(nxt);
      }
    }
    swap(Q, nQ);
  }
  return 0;
}

int main()
{
  while (W = in(), H = in()){
    memset(way, 0, sizeof(way));
    for (int x = 0; x < W - 1; x++){
      if (in() == 0) way[x][x + 1] = way[x + 1][x] = 1;
    }
    for (int y = 1; y < H; y++){
      for (int x = 0; x < W; x++){
        if (in() == 0) way[y * W + x][y * W + x - W] = way[y * W + x - W][y * W + x] = 1;
      }
      for (int x = 0; x < W - 1; x++){
        if (in() == 0) way[y * W + x][y * W + x + 1] = way[y * W + x + 1][y * W + x] = 1;
      }
    }
    cout << bfs() << endl;
  }
  return 0;
}

C++: 
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1166&lang=jp

#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<cmath>
#include<climits>
#include<ctime>
#include<cstring>
#include<numeric>

#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define dump(a) (cerr << #a << "=" << (a) << endl)
#define DUMP(list) cout << "{ "; for(auto nth : list){ cout << nth << " "; } cout << "}" << endl;

using namespace std;

#define INF 1000

int W,H;
int vertical[30][30];
int horizontal[30][30];
int maze[30][30];

void init()
{
	fill_n((int *)vertical, sizeof(vertical) / sizeof(int), 0);
	fill_n((int *)horizontal, sizeof(horizontal) / sizeof(int), 0);
	fill_n((int *)maze, sizeof(maze) / sizeof(int), INF);
}

void dfs(int x, int y, int deep)
{

	if(x < 0 || x > W || y < 0 || y > H){ return; }

	if(maze[y][x] <= deep){ return; }

	maze[y][x] = deep;

	if(x < W-1 && !vertical[y][x]){ dfs(x+1, y, deep+1); } //右
	if(x > 0 && !vertical[y][x-1]){ dfs(x-1, y, deep+1); } //左
	if(y > 0 && !horizontal[y-1][x]){ dfs(x, y-1, deep+1); } //上
	if(y < H-1 && !horizontal[y][x]){ dfs(x, y+1, deep+1);} //下
	return;
}

int main()
{
	while(cin >> W >> H && H)
	{
		init();
		rep(h,H-1)
		{
			rep(w,W-1){
				cin >> vertical[h][w];
			}
			rep(w,W){
				cin >> horizontal[h][w];
			}
		}

		rep(w,W-1){
			cin >> vertical[H-1][w];
		}

		dfs(0,0,1);

		cout << ( maze[H-1][W-1] != INF ? maze[H-1][W-1] : 0 ) << endl;
	}
	return 0;
}