E

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
#include <array>
#include <set>
#include <map>

using namespace std;

#define int long long

const long long INF = 1e18 + 7;
const int MAXN = 1e5 + 100;
const int N = 3e5 + 10;
const int MOD = 1e9 + 7;

int dp[MAXN][1 << 7];
int s[MAXN][7];

bool comp(const pair<int, int>& lhs, const pair<int, int>& rhs) {
    return lhs.first > rhs.first;
}

void init_dp(int n, int p) {
    for (int i = 0; i <= n; ++i) {
        for (int j = 0; j < (1 << p); ++j) {
            dp[i][j] = -1;
        }
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, p, k;
    cin >> n >> p >> k;
    init_dp(n, p);
    vector<pair<int, int>> a(n + 1);
    for (int i = 1; i <= n; ++i) {
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(a.begin() + 1, a.end(), comp);
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j < p; ++j) {
            cin >> s[i][j];
        }
    }
    dp[0][0] = 0;
    for (int i = 1; i <= n; ++i) {
        for (int mask = 0; mask < (1 << p); ++mask) {
            if (dp[i - 1][mask] != -1) {
                int cnt = (i - 1) - __builtin_popcountll(mask);
                dp[i][mask] = dp[i - 1][mask] + (cnt < k ? a[i].first : 0);
            }
            for (int j = 0; j < p; ++j) {
                if (!(mask & (1 << j)) || dp[i - 1][mask ^ (1 << j)] == -1) {
                    continue;
                }
                int pos = a[i].second;
                dp[i][mask] = max(dp[i][mask], dp[i - 1][mask ^ (1 << j)] + s[pos][j]);
            }
        }
    }
    cout << dp[n][(1 << p) - 1] << '\n';
}