#[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!(usize, usize);
    let a = get!(String; h).into_iter().map(|e| e.chars().collect::<Vec<_>>()).collect::<Vec<_>>();

    let mut visited = vec![vec![false;w];h];
    let dr = vec![1,0];
    let dc = vec![0,1];

    let mut could_goal = false;
    let mut queue = VecDeque::new();
    queue.push_back((0,0));
    visited[0][0] = true;
    while let Some((row,col)) = queue.pop_front() {
        for i in 0..2 {
            let ncol = col+dc[i];
            let nrow = row+dr[i];
            if ncol > w-1 || nrow > h-1 {
                continue;
            }
            if a[nrow][ncol] == '.' || visited[nrow][ncol] {
                continue;
            }
            if ncol == w-1 && nrow == h-1 {
                could_goal = true;
            }
            queue.push_back((nrow,ncol));
            visited[nrow][ncol] = true;
            break;
        }
    }
    if !could_goal {
        println!("Impossible");
        return;
    }
    for i in 0..h {
        for j in 0..w {
            if a[i][j] == '#' && !visited[i][j] {
                println!("Impossible");
                return;
            }
        }
    }
    println!("Possible");
}


Measured memory_bytes: 8572