use std::io::*;
use std::str::FromStr;

#[allow(dead_code)]
fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}

type Weight = i32;
#[allow(dead_code)]
#[derive(Clone, Debug, Eq, PartialEq)]
struct Edge {
    index: usize,
    src: usize,
    dest: usize,
    weight: Weight,
}
#[allow(dead_code)]
impl Edge {
    fn new(index: usize, src: usize, dest: usize, weight: Weight) -> Edge {
        Edge {
            index: index,
            src: src,
            dest: dest,
            weight: weight,
        }
    }
}
impl std::cmp::Ord for Edge {
    fn cmp(&self, other: &Self) -> std::cmp::Ordering {
        (self.weight, self.src, self.dest).cmp(&(other.weight, other.src, other.dest))
    }
}
impl std::cmp::PartialOrd for Edge {
    fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
        Some(self.cmp(other))
    }
}
type Edges = Vec<Edge>;
type Graph = Vec<Edges>;
#[allow(dead_code)]
fn graph_new(n: usize) -> Graph {
    vec![vec![]; n]
}
#[allow(dead_code)]
fn add_bi_edge(graph: &mut Graph, index: &mut usize, src: usize, dest: usize, weight: Weight) {
    graph[src].push(Edge::new(*index, src, dest, weight));
    graph[dest].push(Edge::new(*index, dest, src, weight));
    *index += 1;
}
#[allow(dead_code)]
fn add_uni_edge(graph: &mut Graph, index: &mut usize, src: usize, dest: usize, weight: Weight) {
    graph[src].push(Edge::new(*index, src, dest, weight));
    *index += 1;
}

fn calc_min_c(y_cnt: usize, x_cnt: usize, ds: &Vec<Vec<i32>>, visit: &mut Vec<Vec<bool>>) -> i32 {
    let mut ret = -1;
    for i in 0..ds.len() {
        for j in 0..ds[0].len() {
            let v = ds[i][j] - (i as i32 + 1) * y_cnt as i32 - (j as i32 + 1) * x_cnt as i32;
            ret = std::cmp::max(ret, v);
        }
    }
    if ret < 0 || 100 < ret { return ret; }
    for i in 0..ds.len() {
        for j in 0..ds[0].len() {
            let v = ds[i][j] - (i as i32 + 1) * y_cnt as i32 - (j as i32 + 1) * x_cnt as i32;
            if v == ret { visit[i][j] = true; }
        }
    }
    ret
}

const MAX_N: usize = 100;
fn x_node(i: usize) -> usize { i }
fn y_node(i: usize) -> usize { i + 110 }

fn main() {
    let a: usize = read();
    let b: usize = read();
    let mut ds = vec![vec![0 as i32; a]; b];
    for x in 0..a {
        for y in 0..b {
            ds[y][x] = read();
        }
    }
    let mut g = graph_new(300);
    let mut e = 0;
    for i in 0..MAX_N+1 {
        add_uni_edge(&mut g, &mut e, x_node(i), x_node(i + 1), -1);
        add_uni_edge(&mut g, &mut e, y_node(i + 1), y_node(i), -2);
    }
    let mut visit = vec![vec![false; a]; b];
    for y_cnt in 0..MAX_N+1 {
        for x_cnt in 0..MAX_N+1 {
            let c = calc_min_c(y_cnt, x_cnt, &ds, &mut visit);
            if 0 <= c && c <= 100 { add_uni_edge(&mut g, &mut e, x_node(x_cnt), y_node(y_cnt), c); }
        }
    }
    for y in 0..b {
        for x in 0..a {
            if !visit[y][x] {
                println!("Impossible");
                return;
            }
        }
    }
    println!("Possible");
    println!("{} {}", g.len(), e);
    for edges in g.iter() {
        for edge in edges.iter() {
            print!("{} {} ", edge.src + 1, edge.dest + 1);
            match edge.weight {
                -1 => print!("X"),
                -2 => print!("Y"),
                _ => print!("{}", edge.weight),
            }
            println!("");
        }
    }
    println!("{} {}", x_node(0) + 1, y_node(0) + 1);
}

Measured memory_bytes: 4352