//#pragma comment(linker, "/STACK:1024000000,1024000000")

#include<cstdio>

#include<cstring>

#include<cstdlib>

#include<algorithm>

#include<iostream>

#include<sstream>

#include<cmath>

#include<climits>

#include<string>

#include<map>

#include<queue>

#include<vector>

#include<stack>

#include<set>

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

typedef pair<int,int> pii;

#define pb(a) push(a)

#define INF 0x1f1f1f1f

#define lson idx<<1,l,mid

#define rson idx<<1|1,mid+1,r

#define PI  3.1415926535898

template<class T> T min(const T& a,const T& b,const T& c) {

    return min(min(a,b),min(a,c));

}

template<class T> T max(const T& a,const T& b,const T& c) {

    return max(max(a,b),max(a,c));

}

void debug() {

#ifdef ONLINE_JUDGE

#else

    freopen("in.txt","r",stdin);

   // freopen("d:\\out1.txt","w",stdout);

#endif

}

int getch() {

    int ch;

    while((ch=getchar())!=EOF) {

        if(ch!=' '&&ch!='\n')return ch;

    }

    return EOF;

}

const int maxn = ;

int X[maxn], Y[maxn], B[maxn];

int P[maxn], Q[maxn], C[maxn];

int E[maxn][maxn];

int N, M;

bool input()

{

    if(scanf("%d%d", &N, &M) == EOF) return false;

    for(int i = ; i <= N; i++)

        scanf("%d%d%d", &X[i], &Y[i], &B[i]);

    for(int i = ; i <= M; i++)

        scanf("%d%d%d", &P[i], &Q[i], &C[i]);

    for(int i = ; i <= N; i++)

        for(int j = ; j <= M; j++)

            scanf("%d", &E[i][j]);

    return true;

}

struct Edge

{

    int from, to, cost, cap;

};

const int maxv = maxn * ;

int n,s,t;

vector<int> g[maxv];

vector<Edge> edge;

int road[maxv];

int d[maxv];

int inq[maxv];

int vcnt[maxv];

int SPFA()

{

    queue<int> q;

    memset(d, INF, sizeof(d));

    memset(inq, false, sizeof(inq));

    memset(vcnt, , sizeof(vcnt));

    d[s] = ;

    road[s] = -;

    q.push(s);

    while(!q.empty())

    {

        int u = q.front(); q.pop();

        inq[u] = false;

        for(int i = ; i < g[u].size(); i++)

        {

            Edge &e = edge[g[u][i]];

            if(e.cap >  && d[e.to] > d[u] + e.cost)

            {

                d[e.to] = d[u] + e.cost;

                road[e.to] = g[u][i];

                if(!inq[e.to])

                {

                    inq[e.to] = true;

                    if(++vcnt[e.to] > n) return e.to;

                    q.push(e.to);

                }

            }

        }

    }

    return -;

}

void add(int from, int to, int cost, int cap, int flow)

{

    edge.push_back((Edge){from, to, cost, cap - flow});

    g[from].push_back(edge.size() - );

    edge.push_back((Edge){to, from, -cost, flow});

    g[to].push_back(edge.size() - );

}

int Cost(int i, int j)

{

    return abs(X[i] - P[j]) + abs(Y[i] - Q[j]) + ;

}

void init()

{

    for(int i = ; i <= n; i++)

        g[i].clear();

    edge.clear();

}

void construct()

{

    n = N + M + ;

    s = n - ;

    t = n;

    init();

    int sum[maxn] = {};

    for(int i = ; i <= N; i++)

        for(int j = ; j <= M; j++)

            sum[j] += E[i][j];

    for(int i = ; i <= N; i++)

        add(s, i, , B[i], );

    for(int j = ; j <= M; j++)

        add(j + N, t, , C[j], sum[j]);

    for(int i = ; i <= N; i++)

        for(int j = ; j <= M; j++)

            add(i, j + N, Cost(i, j), min(B[i], C[i]), E[i][j]);

}

int vis[maxv];

void solve()

{

    int u = SPFA();

    if(u == -)

    {

        printf("OPTIMAL\n");

        return ;

    }

    memset(vis, , sizeof(vis));

    while()

    {

        if(vis[u]) break;

        vis[u] = true;

        u = edge[road[u]].from;

    }

    memset(vis, , sizeof(vis));

    for(int e = road[u]; !vis[edge[e].to]; e = road[edge[e].from])

    {

        int x = edge[e].from;

        int y = edge[e].to;

        vis[y] = true;

        if(x == t || y == t) continue;

        if(x < y) E[x][y - N] += ;

        else E[y][x - N] -= ;

    }

    printf("SUBOPTIMAL\n");

    for(int i = ; i <= N; i++)

        for(int j = ; j <= M; j++)

            printf("%d%c", E[i][j], j == M? '\n': ' ');

}

int main()

{

    debug();

    while(input())

    {

        construct();

        solve();

    }

    return ;

}