use std::collections::hash_set::Iter;
use std::rc::Rc;
use std::ops::DivAssign;
use std::ops::MulAssign;
use std::ops::SubAssign;
use std::collections::BinaryHeap;
use std::str::FromStr;
use std::collections::HashSet;
use std::collections::BTreeMap;
use std::fmt::Display;
use std::ops::Neg;
use std::ops::Div;
use std::ops::Mul;
use std::ops::Add;
use std::ops::{AddAssign, Sub};
use std::cmp::max;
use std::collections::VecDeque;
use std::cmp::min;
use std::collections::{HashMap, BTreeSet};
use std::cmp::Ordering;
use std::fmt::Debug;

fn read_line() -> String {
    let mut buffer = String::new();
    std::io::stdin().read_line(&mut buffer).expect("No Line");
    buffer.trim().to_owned()
}
fn read_lines<T: std::str::FromStr>(count: usize) -> Vec<T> {
    let mut buffer = String::new();
    let mut vec = Vec::with_capacity(count);
    for _ in 0 .. count {
        std::io::stdin().read_line(&mut buffer).expect("No Line");
        vec.push(buffer.trim().parse().ok().expect("Can't Parse"));
        buffer.clear();
    }
    vec
}
fn read_tabulate<R, T: Fn(&str)->R> (count: usize, transformer: T) -> Vec<R> {
    let mut buffer = String::new();
    let mut vec = Vec::with_capacity(count);
    for _ in 0 .. count {
        std::io::stdin().read_line(&mut buffer).expect("No Line");
        vec.push(transformer(buffer.trim()));
        buffer.clear();
    }
    vec
}
fn read_value<T: std::str::FromStr>() -> T {
    read_line().trim().parse().ok().unwrap()
}
fn read_values<T: std::str::FromStr>() -> Vec<T> {
    read_line().trim().split_whitespace().map(|x| x.parse().ok().expect("Can't Parse")).collect::<Vec<T>>()
}
macro_rules! freeze {
    ($($id:ident), *) => {
        $(let $id = $id;)*
    };
}
macro_rules! read_map {
    ($ident: ident: [$block: block; $size: expr]) => {
        let $ident = (0 .. $size).into_iter().map(|_| $block).collect::<Vec<_>>();
    };
    (mut $ident: ident: [$block: block; $size: expr]) => {
        let mut $ident = (0 .. $size).into_iter().map(|_| $block).collect::<Vec<_>>();
    };
}
macro_rules! read {
    (mut $ident: ident: String) => {
        let mut $ident = read_value::<String>();
    };
    ($ident: ident: String) => {
        let $ident = read_value::<String>();
    };
    (mut $ident: ident: [$ty:ty]) => {
        let mut $ident = read_values::<$ty>();
    };
    ($ident: ident: [$ty:ty]) => {
        let $ident = read_values::<$ty>();
    };
    (mut $ident: ident: [[$ty:ty]; $size: expr]) => {
        let mut $ident = (0 .. $size).into_iter().map(|_| read_values::<$ty>()).collect::<Vec<_>>();
    };
    ($ident: ident: [[$ty:ty]; $size: expr]) => {
        let $ident = (0 .. $size).into_iter().map(|_| read_values::<$ty>()).collect::<Vec<_>>();
    };
    (mut $ident: ident: [$ty:ty; $size:expr]) => {
        let mut $ident = read_lines::<$ty>($size);
    };
    ($ident: ident: [$ty:ty; $size:expr]) => {
        let $ident = read_lines::<$ty>($size);
    };
    ($ident: ident: [$block: block; $size: expr]) => {
        let $ident = (0 .. $size).into_iter().map(|_| $block).collect::<Vec<_>>();
    };
    (mut $ident: ident: [$block: block; $size: expr]) => {
        let mut $ident = (0 .. $size).into_iter().map(|_| $block).collect::<Vec<_>>();
    };
    ($($token: tt)*) => {
        let mut iter = read_values::<String>().into_iter();
        read_from_iter!(iter; $($token)*);
    };
}
macro_rules! read_from_iter {
    ($iter:expr; mut $ident:ident:$ty:ty, $($rest:tt)*) => {
        let mut $ident = $iter.next().unwrap().parse::<$ty>().expect("Can't Parse");
        read_from_iter!($iter; $($rest)*);
    };
    ($iter:expr; $ident:ident:$ty:ty, $($rest:tt)*) => {
        let $ident = $iter.next().unwrap().parse::<$ty>().expect("Can't Parse");
        read_from_iter!($iter; $($rest)*);
    };
    ($iter:expr; mut $ident:ident:$ty:ty) => {
        let mut $ident = $iter.next().unwrap().parse::<$ty>().expect("Can't Parse");
    };
    ($iter:expr; $ident:ident:$ty:ty) => {
        let $ident = $iter.next().unwrap().parse::<$ty>().expect("Can't Parse");
    };
    ($iter: expr; ) => {};
}
struct KeyValue<K, V> {
    key: K,
    value: V
}
impl <K: PartialOrd, V> PartialEq for KeyValue<K, V> {
    fn eq(&self, other: &Self) -> bool {
        self.key.eq(&other.key)
    }
}
impl <K: PartialOrd, V> Eq for KeyValue<K, V> {}
impl <K: PartialOrd, V> PartialOrd for KeyValue<K, V> {
    fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
        self.key.partial_cmp(&other.key)
    }
}
impl <K: PartialOrd, V> Ord for KeyValue<K, V> {
    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
        self.key.partial_cmp(&other.key).ok_or("Can't Compare").unwrap()
    }
}
#[derive(Eq, PartialEq)]
struct Rev<T: Ord>(T);
impl <T: std::cmp::Ord> PartialOrd for Rev<T> {
    fn partial_cmp(&self, rhs: &Rev<T>) -> std::option::Option<std::cmp::Ordering> { 
        rhs.0.partial_cmp(&self.0)
    }
}
impl <T: Ord> Ord for Rev<T> {
    fn cmp(&self, rhs: &Self) -> std::cmp::Ordering { 
        rhs.0.cmp(&self.0)
    }
}
#[derive(Copy, Clone, Debug)]
struct Coordinate {
    x: i32, y: i32
}
impl Add for Coordinate {
    type Output = Coordinate;
    fn add(self, rhs: Coordinate) -> <Self as std::ops::Add<Coordinate>>::Output { 
        Coordinate{x: self.x + rhs.x, y: self.y + rhs.y}
    }
}
impl Coordinate {
    fn all_dir() -> Vec<Coordinate> {
        vec![Coordinate{x: 1, y: 0}, Coordinate{x: -1, y: 0}, Coordinate{x: 0, y: 1}, Coordinate{x: 0, y: - 1}]
    }
}
fn max_rest(state: &mut Vec<Vec<usize>>, current: Coordinate, rest: i32) -> Option<i32> {
    if rest < 0 {
        return None;
    }
    if current.y < 0 || state.len() as i32 <= current.y || current.x < 0 || state[current.y as usize].len() as i32 <= current.x {
        return None;
    }
    if state[current.y as usize][current.x as usize] == 3 {
        return Some(rest);
    }
    if rest == 0 {
        return None;
    }
    let mut result = None;
    for dir in Coordinate::all_dir() {
        let mut next = current + dir;
        if 0 <= next.y && next.y < state.len() as i32 && 0 <= next.x && next.x < state[next.y as usize].len() as i32 {
            if state[next.y as usize][next.x as usize] == 1 {continue;}
        }else {
            continue;
        }
        let mut nn = next + dir;
        while 0 <= nn.y && nn.y < state.len() as i32 && 0 <= nn.x && nn.x < state[nn.y as usize].len() as i32 && state[nn.y as usize][nn.x as usize] != 1 && state[next.y as usize][next.x as usize] != 3 {
            next = nn;
            nn = nn + dir;
        }
        let mut changed = false;
        if state[next.y as usize][next.x as usize] != 3 && (nn.y < 0 || state.len() as i32 <= nn.y || nn.x < 0 || state[nn.y as usize].len() as i32 <= nn.x) {continue;}
        if 0 <= nn.y && nn.y < state.len() as i32 && 0 <= nn.x && nn.x < state[nn.y as usize].len() as i32 && state[nn.y as usize][nn.x as usize] == 1 {
            state[nn.y as usize][nn.x as usize] = 0;
            changed = true;
        }
        if let Some(res) = result {
            if let Some(r) = max_rest(state, next, rest - res - 1) {
                result = Some(res + r);
            }
        }else {
            if let Some(r) = max_rest(state, next, rest - 1) {
                result = Some(r);
            }
        }
        if changed {
            state[nn.y as usize][nn.x as usize] = 1;
        }
    }
    result
}
fn main() {
    loop {
        read!(width: usize, height: usize);
        if width == 0 && height == 0{break;}
        read!(mut state: [[usize]; height]);
        let start = (0 .. height).flat_map(|y| (0 .. width).find(|&x| state[y][x] == 2).map(|x| Coordinate{x: x as i32, y: y as i32})).next().unwrap();
        println!("{}", 10 - max_rest(&mut state, start, 10).unwrap_or(11));
    }
}


Measured memory_bytes: 5052