#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

fn solve() {
    let (h,w) = get!(isize, isize);
    let ss = get!(String; h);

    let mut sb = Vec::with_capacity(h as usize);
    let mut count = 0;
    for s in ss {
        let mut tmp = Vec::with_capacity(w as usize);
        for c in s.chars() {
            if c == '#' {
                count += 1;
            }
            tmp.push(c == '.');
        }
        sb.push(tmp);
    }


    let mut queue = VecDeque::new();
    let mut seen = BTreeSet::new();
    queue.push_back((0,0,1));
    seen.insert((0,0));
    let dx = vec![0isize,0,1,-1];
    let dy = vec![1isize,-1,0,0];

    while let Some((x,y,d)) = queue.pop_front() {
        for i in 0..4 {
            let x = x+dx[i];
            let y = y+dy[i];
            if x < 0 || x > w-1 || y < 0 || y > h-1 {
                continue;
            }
            if seen.contains(&(x,y)) || !sb[y as usize][x as usize] {
                continue;
            }
            if x == w-1 && y == h-1 {
                println!("{}", h*w-d-1-count);
                return;
            }
            queue.push_back((x,y,d+1));
            seen.insert((x,y));
        }
    }
    println!("-1");
    
}


Measured memory_bytes: 8572