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 <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <climits>
#include <complex>
#include <numeric>
using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define RREP(i,n) for(int i=(int)n-1; i>=0; i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();++i)
#define ALL(c) (c).begin(), (c).end()

typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > pipii;
typedef vector<int> vi;

const int INF = 1e9;
const int MOD = 1e9+7;

int main(void){
  int n = 100;
  int a, b;
  int f = 1;
  cin >> a >> b;
  vector<vi> d(a, vi(b));
  vector<vi> finished(a, vi(b, 0));
  REP(i, a) REP(j, b) cin >> d[i][j];
  vector<vector<pii> > g(2 * n + 2);
  REP(i, n + 1) {
    REP(j, n + 1) {
      int min_cost = 0;
      REP(k, a) {
        REP(l, b) {
          int x = (k + 1) * i + (l + 1) * j;
          int y = x - d[k][l];
          if(y < 0) min_cost = max(min_cost, -y);
        }
      }
      g[i+10].push_back(pii(220 - j, min_cost));
      REP(k, a) {
        REP(l, b){
          if((k + 1) * i + (l + 1) * j + min_cost == d[k][l]) finished[k][l] = 1;
        }
      }
    }
  }
  REP(i, a) REP(j, b) if(!finished[i][j]) f = 0;

  if(!f) {
    cout << "Impossible" << endl;
    return 0;
  }
  cout << "Possible" << endl;
  int m = 2 * n + 2;
  REP(i, g.size()) m += g[i].size();
  cout << "300 " << m << endl;
  cout << "1 10 0" << endl;
  cout << "220 2 0" << endl;
  REP(i, 100) {
    cout << i + 10 << " " << i + 11 << " X" << endl;
    cout << i + 120 << " " << i + 121 << " Y" << endl;
  }
  REP(i, g.size()) {
    REP(j, g[i].size()) {
      cout << i << " " << g[i][j].first << " " << g[i][j].second << endl;
    }
  }
  cout << "1 2" << endl;
}