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 <stack>
#include <stdlib.h>
#include <cstdlib>
#include <queue>

using namespace std;

//pair:p??????????????????????????¨??????????????´???
bool pass(const int w, const int h, const pair<int,int> cur, const pair<int,int> p, const vector<vector<int> > &length, const vector<vector<int> > &width, const vector<vector<int> > &passed) {
  
  //??????????????°???
  if (p.first < 0 || p.second < 0) return false;
  //w???h????¶???????
  if (p.first >= h || p.second >= w) return false;

  //???????¨???????????????´???
  if (passed[p.first][p.second] == 0) {  
    //?£??????????????????????
    //???????£?
    if (abs(p.first - cur.first)) {
      if (p.first - cur.first > 0) {
	int i = width[cur.first][cur.second];
	if (i) return false;
	else   return true;
      }
      else {
	int i = width[p.first][p.second];
	if (i) return false;
	else   return true;
      }
    }
    //?¨?????£?
    else if (abs(p.second - cur.second)) {
      if (p.second - cur.second > 0) {
	int i = length[cur.first][cur.second];
	if (i) return false;
	else   return true;
      }
      else {
	int i = length[p.first][p.second];
	if (i) return false;
	else   return true;
      }  
    }
  }
  return false;
}

void search(const int w, const int h, const vector<vector<int> > &length, const vector<vector<int> > &width, pair<int,int> cur, queue<pair<int,int> > &q, vector<vector<int> > &passed) {

  pair<int,int> next;

  //down
  next = make_pair(cur.first+1, cur.second);
  if (pass(w, h, cur, next, length, width, passed)){
    q.push(next);
    passed[next.first][next.second] = passed[cur.first][cur.second] + 1;
    //cout << "candidate::" << next.first << next.second << endl;
  }
    
  //right
  next = make_pair(cur.first, cur.second+1);
  if (pass(w, h, cur, next, length, width, passed)){
    q.push(next);
    passed[next.first][next.second] = passed[cur.first][cur.second] + 1;
    //cout << "candidate::" << next.first << next.second << endl;
  }
  
  //up
  next = make_pair(cur.first-1, cur.second);
  if (pass(w, h, cur, next, length, width, passed)){
    q.push(next);
    passed[next.first][next.second] = passed[cur.first][cur.second] + 1;
    //cout << "candidate::" << next.first << next.second << endl;
  }
  
  //left
  next = make_pair(cur.first, cur.second-1);
  if (pass(w, h, cur, next, length, width, passed)){
    q.push(next);
    passed[next.first][next.second] = passed[cur.first][cur.second] + 1;
    //cout << "candidate::" << next.first << next.second << endl;
  }
}

int main(int argc, char *argv[]) {

  while (true) {
  int h, w;  //height and width of maze
  bool flag = false;
  
  cin >> w >> h;
  if(w == 0) break;
  vector<vector<int> > length;//(w-1,vector<int>(h));
  vector<vector<int> > width;//(w, vector<int>(h-1));

  vector<vector<int> > passed;
  passed.resize(h);
  for (int i = 0; i < h; i++)
    passed[i].resize(w);
  pair<int,int> start, goal;
  start = make_pair(0,0);
  goal = make_pair(h-1,w-1);

  length.resize(h); width.resize(h);
  for (int i = 0; i < h; i++) {
    length[i].resize(w);
    width[i].resize(w);
    }
  
  for (int i = 0; i < h-1; i++) {
    for (int j = 0; j < w-1; j++) {
      int e;
      cin >> e;
      length[i][j] = e;
    }
    for (int j = 0; j < w; j++) {
      int e;
      cin >> e;
      width[i][j] = e;
    } 
  }
  for (int j = 0; j < w-1; j++) {
    int e;
    cin >> e;
    length[h-1][j] = e;
  }

  for (int i = 0; i < h; i++) 
    for (int j = 0; j < w; j++)  
      passed[i][j] = 0;
  
  queue<pair<int, int> > q;
  q.push(start);

  while ( !q.empty() ) {
    pair<int,int> cur = q.front(); q.pop();
    //cout << "cur::" << cur.first << cur.second << endl;
    if (cur == goal) {
      flag = true;
      cout << passed[cur.first][cur.second] + 1 << endl;
    }
    search(w, h, length, width, cur, q, passed);
  }
  if(!flag)
    cout << 0 << endl;
  }
  return 0;
}