#include <bits/stdc++.h>
 
//#include <unistd.h>
//#include <iostream>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

signed main() {
	int a, b;
	cin >> a >> b;
	vii d(a, vi(b));
	rep (i, a) {
		rep (j, b) {
			cin >> d[i][j];
		}
	}

	vii used(a, vi(b));

	vi aa, bb, cc;
	int ma = 100;
	rep (aaa, ma + 1) {
		rep (bbb, ma + 1) {
			rep (ccc, ma + 1) {
				bool flag = true;
				vector<pii> xy;
				rep1 (x, a) {
					rep1 (y, b) {
						if (aaa * x + bbb * y + ccc < d[x - 1][y - 1]) {
							flag = false;
							break;
						}
						else if (aaa * x + bbb * y + ccc == d[x - 1][y - 1] and not used[x - 1][y - 1]) {
							xy.emplace_back(x - 1, y - 1);
						}
					}
					if (not flag) break;
				}
				if (not flag) continue;
				if (xy.size() > 0) {
					rep (i, xy.size()) {
						used[xy[i].first][xy[i].second] = true;
					}
					aa.push_back(aaa);
					bb.push_back(bbb);
					cc.push_back(ccc);
				}
			}
		}
	}
	//DEBUG_VEC(aa);
	//DEBUG_VEC(bb);
	//DEBUG_VEC(cc);

	bool flag = true;
	rep (i, a) {
		rep (j, b) {
			if (not used[i][j]) flag = false;
		}
	}
	if (not flag) {
		cout << "Impossible" << endl;
		return 0;
	}
	cout << "Possible" << endl;

	int n = ma * 2 + 2;
	vi u, v, w;
	rep (i, n / 2 - 1) {
		u.push_back(i);
		v.push_back(i + 1);
		w.push_back(-1);
	}
	rep (i, n / 2 - 1) {
		u.push_back(n / 2 + i);
		v.push_back(n / 2 + i + 1);
		w.push_back(-2);
	}
	rep (i, aa.size()) {
		u.push_back(aa[i]);
		v.push_back(n - 1 - bb[i]);
		w.push_back(cc[i]);
	}
	cout << n << " " << u.size() << endl;
	rep (i, u.size()) {
		cout << u[i] + 1 << " " << v[i] + 1;
		if (w[i] == -1) {
			cout << " " << "X" << endl;
		}
		else if (w[i] == -2) {
			cout << " " << "Y" << endl;
		}
		else {
			cout << " " << w[i] << endl;
		}
	}
	cout << 1 << " " << n << endl;
}

Measured memory_bytes: 384