#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

const int INF = 100;

int pow[10];
int a[10][10];
char dp[10][10][60000];
char bio[10][10][60000];
char f[60000][10];
int n, m, cookie;

inline int modify( int s, int y, int k, int l ) { return ( s + (l-f[s][k])*pow[k] + (m-f[s][y])*pow[l] ); }

inline char min( char a, char b ) { return a < b ? a : b; }

char solve( int x, int y, int s ) {
  if( y == m ) {
    if( f[s][m] ) return INF;
    return solve( x+1, 0, s );
  }
  if( x == n ) return ( s != 0 )*INF;

  if( bio[x][y][s] == cookie ) return dp[x][y][s];

  char &r = dp[x][y][s]; r = INF;
  bio[x][y][s] = cookie;

  int l = f[s][m], u = f[s][y];
  if( a[x][y] == 0 ) { //zid
    if( l || u ) return r = INF;
    return r = solve( x, y+1, modify( s, y, 0, 0 ) );
  }

  if( l && u ) { //oba
    if( l != u || a[x][y] > 0 ) return r = INF;
    return r = solve( x+1, y, modify( s, y, 0, 0 ) );
  }

  l |= u;
  if( l ) { //jedan
    if( a[x][y] > 0 && a[x][y] != l ) return r = INF;
    if( a[x][y] > 0 ) return r = solve( x, y+1, modify( s, y, 0, 0 ) );
    r = min( r, solve( x+1, y+1, modify( s, y, 0, l ) ) );
    r = min( r, solve( x+1, y+1, modify( s, y, l, 0 ) ) );
    return r;
  }

  //nijedan
  if( a[x][y] > 0 ) return r = 1+min( solve( x+1, y, modify( s, y, 0, a[x][y] ) ), solve( x, y+1, modify( s, y, a[x][y], 0 ) ) );
  for( int i = 0; i < 3; ++i )
    r = min( r, 2*i + solve( x+1, y, modify( s, y, i, i ) ) );
  return r;
}

int main( void ) {
  pow[0] = 1;
  for( int i = 1; i < 10; ++i ) pow[i] = pow[i-1]*3;
  for( int i = 0; i < 60000; ++i )
    for( int j = 0, x = i; j < 10; ++j, x /= 3 )
      f[i][j] = x%3;

  while( scanf( "%d %d", &n, &m ) == 2 ) {
    if( n == 0 && m == 0 ) break;

    for( int i = 0; i < n; ++i )
      for( int j = 0; j < m; ++j ) {
    scanf( "%d", a[i]+j );
    --a[i][j];
      }

    cookie++;
    int r = solve( 0, 0, 0 );
    if( r >= INF ) r = 0;
    printf( "%d\n", r );
  }
  return 0;
}