#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <ctime>
#include <vector>
#include <queue>
#include <bitset>
#include <cmath>
#include <time.h>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stdlib.h>
#include <deque>
#include <iomanip>
#include <complex>
//#include <ext/rope>

using namespace std;
//using namespace __gnu_cxx;

//defines
typedef long long ll;
typedef long double ld;
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
#define fast_read cin.sync_with_stdio(0)
#define PREX(number) cout << fixed << setprecision(number)
#define nul point(0, 0)
#define random srand(time(NULL))
#define rand_int abs((rand() << 15) | rand())
#define str_to_int(stroka) atoi(stroka.c_str())
#define str_to_ll(stroka) atoll(stroka.c_str())
#define str_to_double(stroka) atof(stroka.c_str())
#define what_is(x) cerr << #x << " is " << x << endl
#define solve_system int number; cin >> number; forn(i, 0, number) solve()
#define solve_system_scanf int number; scanf("%d", &number); forn(i, 0, number) solve()

//easy functions
template< typename T >
T gcd(T a, T b) { return a ? gcd(b % a, a) : b; }
template< typename T >
T lcm(T a, T b) { return (a / gcd(a, b)) * b; }
bool is_down(char x) { return ('a' <= x && x <= 'z'); }
bool is_upper(char x) { return ('A' <= x && x <= 'Z'); }
bool is_digit(char x) { return ('0' <= x && x <= '9'); }

//constants
const ld pi = 3.141592653589793238462643383279;
const ld log23 = 1.58496250072115618145373894394781;
const ld eps = 1e-8;
const ld zero = 0;
const ll INF = 1e18;
const int COUT = 30;
const int prost = 239;
const ll prost64 = 239;
const int two = 2;
const int thr = 3;
const ll sr = 31;
const int MOD = 1e9 + 7;
const int BIG = 2 * 1e9 + 1;
const int alf = 26;
const int MAX_N = 2 * 1e5 + 10;
const int MAX_M = 11;
const int MAX_T = (1 << 20);
const int BLOCK = trunc(sqrt(MAX_N)) + 1;
const int MAX_LOG = 19;
const int km = (1 << 18);
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, 1, 0, -1};
const int dxo[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
const int dyo[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
const int bit_max = 32;
const int dig = 10;
const string str_alf = "abcdefghijklmnopqrstuvwxyz";
const string str_alf_big = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const int day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int digarr[10] = {6, 2, 5, 5, 4, 5, 6, 3, 7, 6};
const int bt = 31;

// Code starts here

int n, m, d[MAX_M][MAX_M];
bool used[MAX_M][MAX_M];

bool check(int a, int b, int c)
{
    for (int x = 1; x <= n; x++)
        for (int y = 1; y <= m; y++)
        {
            int now = (x * a + y * b + c);
            if (now < d[x - 1][y - 1])
                return false;
        }
    for (int x = 1; x <= n; x++)
        for (int y = 1; y <= m; y++)
        {
            int now = (x * a + y * b + c);
            if (d[x - 1][y - 1] == now)
                used[x - 1][y - 1] = true;
        }
    return 1;
}

int main()
{   /*
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif /**/
    fast_read;
    cin >> n >> m;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            cin >> d[i][j];
    vector<tuple<int, int, int> > ans;
    for (int a = 0; a <= 100; a++)
        for (int b = 0; b <= 100; b++)
            for (int c = 0; c <= 100; c++)
                if (check(a, b, c))
                {
                    ans.push_back(make_tuple(a, b, c));
                    break;
                }
    bool ch = true;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            ch &= used[i][j];
    if (!ch)
    {
        cout << "Impossible";
        return 0;
    }
    cout << "Possible\n";
    int N = (202);
    vector<tuple<int, int, int> > r;
    for (tuple<int, int, int> t : ans)
        r.push_back(make_tuple(get<0>(t), (100 - get<1>(t)) + 101, get<2>(t)));
    cout << N << " " << r.size() + 200 << "\n";
    for (tuple<int, int, int> t : r)
        cout << get<0>(t) + 1 << " " << get<1>(t) + 1 << " " << get<2>(t) << "\n";
    for (int i = 0; i < 100; i++)
        cout << i + 1 << " " << i + 2 << " " << "X\n";
    for (int i = 0; i < 100; i++)
        cout << i + 1 + 101 << " " << i + 2 + 101 << " " << "Y\n";
    cout << "1 202\n";
    return 0;
}


Measured memory_bytes: 768