/*
TASK:tre
LANG:C++
*/
#include <iostream>
#define MAXL 10002
#define MAXD 102
using namespace std;
int N, K, L, D;
int mx = 0;
int data[MAXD][MAXL];
void ReadData()
{
    int d;
    cin >> N >> K >> L >> D;
    for (int i = 1; i <= D; i++)
    {
        for (int j = 1; j <= L; j++)
        {
            cin >> d;
            data[i][j] = data[i-1][j] + d;
        }
    }
}
void cm (int i)
{
    //cout << "cm(" << i << ");" << endl;
    if (i > mx) mx = i;
}
void rec (int l, int t, int dta)
{
    //cout << "rec(" << l << ", " << t << ", " << dta << ");" << endl;
    for (int i = 0; i <= D; i++)
    {
        cm(dta + data[i][l]);
        if (t + i >= K) break;
        if (l + 1 <= L) rec(l + 1, t + i, dta + data[i][l]);
    }
}
int main()
{
    ReadData();
    //Debug();
    rec (1, 0, 0);
    cout << mx << endl;
    //system("pause");
    return 0;
}
