//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};
vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll a,b;cin>>a>>b;
  auto d=vec(a+1,b+1,0LL);
  rep(i,0,a)rep(j,0,b)cin>>d[i+1][j+1];
  vector<ll>ru,rv,rc1,rc2;
  stringstream output;
  ll cnt=0;
  auto add=[&](ll u,ll v,ll c){
    cnt++;
    if(c==-1){
      output<<u spa v spa "X"<<endl;
    }
    else if(c==-2){
      output<<u spa v spa "Y"<<endl;
    }
    else output<<u spa v spa c<<endl;
  };
  ll num=100;
  ll start=1,goal=1+num+1;
  {
    //1...101:xの道
    //102...203:yの道
    //1->102
    rep(i,start,start+num)add(i,i+1,-1);
    rep(i,goal,goal+num)add(i+1,i,-2);
  }
  auto add_edge=[&](ll ai,ll bi,ll ci){
    //aix + biy + ciを加える
    add(start+ai,goal+bi,ci);
  };
  auto t=vec(a+1,b+1,false);
  rep(i,0,num+1)rep(j,0,num+1){
    ll mic=0;
    rep(x,1,a+1)rep(y,1,b+1){
      ll c=d[x][y]-i*x-j*y;
      //if(i==0&&j==1)cout<<x spa y spa c spa d[x][y] spa -i*x spa -j*y<<endl;
      chmax(mic,c);
    }
    if(mic>num)continue;
    bool sw=false;
    rep(x,1,a+1)rep(y,1,b+1){
      ll c=d[x][y]-i*x-j*y;
      if(c==mic&&!t[x][y]){
        sw=true;
        t[x][y]=true;
      }
    }
    //if(sw)cout<<i spa j spa mic<<endl;
    if(sw)add_edge(i,j,mic);
  }
  rep(i,1,a+1)rep(j,1,b+1)if(!t[i][j])judge=false;
  if(judge){
    cout<<"Possible"<<endl;
    cout<<2*(num+1) spa cnt<<endl;
    cout<<output.str();
    cout<<start spa goal<<endl;
  }
  else cout<<"Impossible"<<endl;
  return 0;
}

Measured memory_bytes: 3696