/*
* Author: Geeza
*/

#include <bits/stdc++.h>

#define ld long double
#define ll long long
#define pb push_back
#define fin(a, n) for(int i = a; i < n; i++)
#define fjn(a, n) for(int j = a; j < n; j++)
#define all(a) a.begin(),a.end()
#define allr(a) a.rbegin(),a.rend()
#define FAST ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)

using namespace std;

const double PI = acos(-1);
const int N = 1e5+5;
const ll oo = 0x3f3f3f3f3f3f3f3f;
const int mod = 1000000007, inf = 1e6;

string di[] = {"D","L", "U", "R", "UL", "UR", "DL", "DR"};
int dx[] = {+1, +0, +0, -1, -1, -1, +1, +1};
int dy[] = {+0, -1, +1, +0, -1, +1, -1, +1};
char dc[] = {'D', 'L', 'R', 'U'};

int n, p, k;
ll dp[N][1<<8]; // idx, mask
vector<pair<ll, int>> v;
vector<vector<ll>> s;

ll calc(int idx, int mask) {
    if (idx == n) return (mask == (1<<p)-1? 0 : -oo);

    ll &ret = dp[idx][mask];
    if (~ret)return ret;
    ret = 0;

    ret = max(ret, calc(idx+1, mask)); // leave
    // take
    // audience
    if (idx < k) {
        ret = max(ret, calc(idx+1, mask) + v[idx].first);
    }

    //player
    for (int i = 0; i < p; i++) {
        if ((mask>>i)&1)continue;
        ret = max(ret, calc(idx+1, mask|(1<<i)) + s[v[idx].second][i]);
    }

    return ret;
}

void solve() {
    cin >> n >> p >> k;
    v.assign(n, {0, 0});
    fin(0, n) cin >> v[i].first, v[i].second = i;
    s = vector<vector<ll>>(n, vector<ll>(p, 0));
    fin(0, n) {
        fjn(0, p) cin >> s[i][j];
    }

    sort(all(v), [&](pair<ll, int> &a, pair<ll, int> &b) {
        return a.first > b.first;
    });

    memset(dp, -1, sizeof dp);
    cout << calc(0, 0) << "\n";
}

int main() {
    FAST;
#ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
#endif
    int tt = 1; //cin >> tt;
    while(tt--){
        solve();
    }
    return 0;
}