#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <cmath>

using namespace std;

int n, m, r[4], a;

vector<vector<int>> v;

vector<vector<int>> c;

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
        cin >> r[i];

    c.resize(m + 1);

    for (int i = 1; i <= m; ++i)
    {
        c[i].resize(n / 2 * (n + 1) + 1);
        for (int j = 1; j <= n / 2 * (n + 1); j++)
            cin >> c[i][j];
    }

    v.resize(n + 1);
    for (int i = 1; i <= n; ++i)
        v[i].resize(m + 1);

    for (int k = 1; k <= n; ++k)
        for (int j = 1; j <= m; ++j)
        {
            vector<int> t;
            for (int k1 = 1; k1 <= k; ++k1)
                for (int l = k; l <= n; ++l)
                    t.push_back(c[j][(k1 - 1) * n + (l - k1 + 1)]);
            t.push_back(r[k]);
            int foo = *min_element(t.begin(), t.end());
            if (foo == r[k])
                v[k][1] = (v[k][1] == 0) ? foo : v[k][1] ;
            else if (foo != r[k])
            {

            }
            v[k][j] = v[k][j] + foo;
        }

    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
            cout << v[i][j] << " ";
        cout << endl;
    }
    cout << endl;

    // C_jkl = c[i][(k-1)*n+(l-k+1)]
    
    // carry over last columnal num
}