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 C++14 (GCC 5.4.1) (judge verdict: Accepted)

// {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
// }}}

using ll = long long;

const int INF = numeric_limits<int>::max();

constexpr int MAX_N = 105;

int A, B, D[11][11];

int F[MAX_N][MAX_N];

int main() {
    cin >> A >> B;
    for (int j = 0; j < A; ++j) {
        for (int k = 0; k < B; ++k) {
            cin >> D[j][k];
        }
    }

    for (int j = 0; j < MAX_N; ++j) for (int k = 0; k < MAX_N; ++k) {
        for (int a = 0; a < A; ++a) for (int b = 0; b < B; ++b) {
            F[j][k] = max(F[j][k], D[a][b] - (a+1) * j - (b+1) * k);
        }
    }

    for (int a = 0; a < A; ++a) for (int b = 0; b < B; ++b) {
        int min_dist = INF;
        for (int j = 0; j < MAX_N; ++j) {
            for (int k = 0; k < MAX_N; ++k) {
                min_dist = min(min_dist, (a+1) * j + (b+1) * k + F[j][k]);
            }
        }
        if (min_dist != D[a][b]) {
            printf("Impossible\n");
            return 0;
        }
    }

    printf("Possible\n%d %d\n", 2*MAX_N, 2*(MAX_N-1) + MAX_N*MAX_N);
    for (int j = 0; j < MAX_N-1; ++j) {
        printf("%d %d X\n", (j+1), (j+2));
    }
    for (int j = 0; j < MAX_N-1; ++j) {
        printf("%d %d Y\n", MAX_N+(j+1), MAX_N+(j+2));
    }
    for (int j = 0; j < MAX_N; ++j) {
        for (int k = 0; k < MAX_N; ++k) {
            printf("%d %d %d\n", (j+1), 2*MAX_N-k, F[j][k]);
        }
    }
    printf("%d %d\n", 1, 2*MAX_N);
    return 0;
}