Problem:
Score : 900 points

Problem Statement

AtCoDeer the deer wants a directed graph that satisfies the following conditions:

The number of vertices, N, is at most 300.

There must not be self-loops or multiple edges.

The vertices are numbered from 1 through N.

Each edge has either an integer weight between 0 and 100 (inclusive), or a label X or Y.

For every pair of two integers (x,y) such that 1 ≤ x ≤ A, 1 ≤ y ≤ B,
the shortest distance from Vertex S to Vertex T in the graph where the edges labeled X have the weight x and the edges labeled Y have the weight y, is d_{x,y}.

Construct such a graph (and a pair of S and T) for him, or report that it does not exist.
Refer to Output section for output format.

Constraints

1 ≤ A,B ≤ 10

1 ≤ d_{x,y} ≤ 100 (1 ≤ x ≤ A, 1 ≤ y ≤ B)

All input values are integers.

Input

Input is given from Standard Input in the following format:

A B
d_{1,1} d_{1,2} .. d_{1,B}
d_{2,1} d_{2,2} .. d_{2,B}
:
d_{A,1} d_{A,2} .. d_{A,B}

Output

If no graph satisfies the condition, print Impossible.

If there exists a graph that satisfies the condition, print Possible in the first line.
Then, in the subsequent lines, print the constructed graph in the following format:

N M
u_1 v_1 c_1
u_2 v_2 c_2
:
u_M v_M c_M
S T

Here, M is the number of the edges, and u_i, v_i, c_i represent edges as follows: there is an edge from Vertex u_i to Vertex v_i whose weight or label is c_i.

Also refer to Sample Outputs.

Sample Input 1

2 3
1 2 2
1 2 3

Sample Output 1

Possible
3 4
1 2 X
2 3 1
3 2 Y
1 3 Y
1 3

Sample Input 2

1 3
100 50 1

Sample Output 2

Impossible

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

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

#[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>>) -> i32 {
    let mut ret = 0;
    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);
        }
    }
    // println!("{} {} {}", y_cnt, x_cnt, ret);
    ret
}

fn calc_use_node(y_cnt: usize, x_cnt: usize, c: i32, ds: &Vec<Vec<i32>>, visit: &mut Vec<Vec<bool>>, use_node: &mut Vec<Vec<bool>>) -> usize {
    let mut ret = 0;
    for i in 0..ds.len() {
        for j in 0..ds[0].len() {
            if visit[i][j] { continue; }
            let v = (i as i32 + 1) * y_cnt as i32 + (j as i32 + 1) * x_cnt as i32 + c;
            if v == ds[i][j] {
                ret += 1;
                visit[i][j] = true;
                use_node[y_cnt][x_cnt] = true;
                // println!("{} {} {} {} {} {}", y_cnt, x_cnt, i, j, v, c);
            }
        }
    }
    ret
}

fn add_xy_edge(g: &mut Graph, e: &mut usize, from: usize, y_cnt: usize, x_cnt: usize, node_map: &mut HashMap<(usize, usize), usize>) {
    if y_cnt == 0 && x_cnt == 0 { return; }
    if g[from].len() == 1 { return; }
    let mut ny_cnt = y_cnt;
    let mut nx_cnt = x_cnt;
    let cost;
    if y_cnt != 0 {
        ny_cnt -= 1;
        cost = -1;
    } else {
        nx_cnt -= 1;
        cost = -2;
    }
    let node = (ny_cnt, nx_cnt);
    if !node_map.contains_key(&node) {
        let to = g.len();
        node_map.insert(node, to);
        g.push(vec![]);
    }
    let to = *node_map.get(&node).unwrap();
    add_uni_edge(g, e, from, to, cost);
    add_xy_edge(g, e, to, ny_cnt, nx_cnt, node_map);
}

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 visit = vec![vec![false; a]; b];
    let mut min_c = vec![vec![0 as i32; 101]; 101];
    let mut use_node = vec![vec![false; 101]; 101];
    let mut total = 0;
    // for i in 0..101 {
    for i in 0..3 {
        for x_cnt in 0..i {
            let y_cnt = i;
            min_c[y_cnt][x_cnt] = calc_min_c(y_cnt, x_cnt, &ds);
            total += calc_use_node(y_cnt, x_cnt, min_c[y_cnt][x_cnt], &ds, &mut visit, &mut use_node);
        }
        for y_cnt in 0..i+1 {
            let x_cnt = i;
            min_c[y_cnt][x_cnt] = calc_min_c(y_cnt, x_cnt, &ds);
            total += calc_use_node(y_cnt, x_cnt, min_c[y_cnt][x_cnt], &ds, &mut visit, &mut use_node);
        }
    }
    // println!("{}", total);
    if total != a * b {
        println!("Impossible");
        return;
    }
    let mut g = graph_new(1);
    let mut node_map = HashMap::<(usize, usize), usize>::new();
    let mut e = 0;
    for y_cnt in 0..101 {
        for x_cnt in 0..101 {
            if !use_node[y_cnt][x_cnt] { continue; }
            let to = g.len();
            g.push(vec![]);
            node_map.insert((y_cnt, x_cnt), to);
            add_uni_edge(&mut g, &mut e, 0, to, min_c[y_cnt][x_cnt]);
            add_xy_edge(&mut g, &mut e, to, y_cnt, x_cnt, &mut node_map);
        }
    }
    assert!(g.len() <= 300);
    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!("1 2")
}