#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <bitset>
#include <queue>

using namespace std;

const int nmx = 7300;

int n,m,r,c; /// r linii , c coloane
int mat[3700][90];
int sum_col[90];
int sol[90];
int sumtotal;
int raspuns;
bitset <90> viz;
priority_queue <int> q;

void citire()
{
    scanf("%d %d %d %d", &n, &m, &r, &c);
    if(n >= m)
    {
        if(m == 1)
        {
            if(c == 1)
            {
                printf("0\n");
            }
            else
            {
                int sum = 0;
                for(int i = 1; i <= n; ++i)
                {
                    int nr;
                    scanf("%d", &nr);
                    sum += nr;
                }
                printf("%d\n", sum);
            }
            exit(0);
        }
        else
        {
            for(int i = 1; i <= n; ++i)
                for(int j = 1; j <= m; ++j)
                    scanf("%d", &mat[i][j]);
        }
    }
    else
    {
        if(n == 1)
        {
            if(r == 1)
            {
                printf("%d\n", 0);
            }
            else
            {
                int sum = 0;
                for(int j = 1; j <= m; ++j)
                {
                    int nr;
                    scanf("%d", &nr);
                    sum += nr;
                }
                printf("%d\n", sum);
            }
            exit(0);
        }
        else
        {
            for(int i = 1; i <= n; ++i)
                for(int j = 1; j <= m; ++j)
                    scanf("%d", &mat[j][i]);
            swap(n,m);
            swap(r,c);
        }
    }
}

void calc_sum_total()
{
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j)
            sumtotal += mat[i][j];
}

void calcul_sum_col()
{
    for(int j = 1; j <= m; ++j)
        for(int i = 1; i <= n; ++i)
            sum_col[j] += mat[i][j];
}

void verif()
{
    int sumaux = sumtotal;

    viz.reset();

    for(int i = 1; i <= c; ++i)
        {
            viz[sol[i]] = true;
            sumaux -= sum_col[sol[i]];
        }

    for(int i = 1; i <= n; ++i)
    {
        int sum_partial = 0;

        for(int j = 1; j <= m; ++j)
            if(not viz[j])
                sum_partial += mat[i][j];

        q.push(-sum_partial);
    }

    int rr = r;

    while(rr)
    {
        sumaux += q.top();
        q.pop();
        -- rr;
    }

    raspuns = max(raspuns,sumaux);
}

void combinari()
{
    for(int i = 1; i <= c; ++i)
        sol[i] = 1;

    bool ok = 1;

    while(ok)
    {
        verif();

        bool kaux = 0;

        for(int i = c; i; --i)
            if(sol[i] + 1 + c - i <= m)
            {
                int val = sol[i] + 1;
                for(int j = i; j <= c; ++j)
                    sol[j] = val++;
                kaux = 1;
                break;
            }

        if(not kaux)
            ok = 0;
    }
}

void afish()
{
    printf("%d\n", raspuns);
}

int main()
{
    freopen("elimin.in", "r", stdin);
    freopen("elimin.out", "w", stdout);
    citire();
    calc_sum_total();
    calcul_sum_col();
    combinari();
    ///afish();

    for(int i = 1; i <= n ;++i)
    {
        for(int j = 1; j <= m ;++j)
            printf("%d ", mat[i][j]);
        printf("\n");
    }

    return 0;
}