CodeCraft-20(Div. 2 abcd

//CodeCraft-20 (Div. 2)

#include <bits/stdc++.h> 
using namespace std;
#define ll long long
#define _for(i,a,b) for(int i = (a); i < (b); i++) 
#define _rep(i,a,b) for(int i = (a); i <= (b); i++)

void taskA(){
    int t; cin >> t;
    while(t--) {
        int n,m; cin >> n >> m;
        vector<int> a(n);
        ll sum = 0;
        _for(i,0,n) cin >> a[i], sum+=a[i];
        cout << min(sum, (ll)m) << "\n";
    }
    return;
}

void taskB1(){
    int t; cin >> t;
    while(t--) {
        int n; cin >> n; 
        string s; cin >> s;
        string ans = s;
        int res = 1;
        _rep(k,2,n) {
            string ans_pre = s.substr(k-1, n);
            string ans_suf = s.substr(0, k-1);
       
            if(n%2 == k%2) 
                reverse(ans_suf.begin(), ans_suf.end());
    // It can be observed that the suffix will be s1..sk−1 if n and k have the same parity and sk−1..s1 otherwise.
            ans_pre += ans_suf;
            if(ans > ans_pre) ans = ans_pre, res = k;
        }
        cout << ans << "\n" << res << "\n";
    }
    return;
}

void taskC(){
    int n,m,p; cin >> n >> m >> p;
    vector<ll> a(n), b(m), c(n+m-1, 0);
    _for(i,0,n) cin >> a[i], a[i] %= p;
    _for(i,0,m) cin >> b[i], b[i] %= p;
    int x = 0, y = 0;
    while(!a[x]) x++;
    while(!b[y]) y++;
    cout << x+y;
    return;
}

const int N = 1010;
int x[N][N], y[N][N], n;
char d[N][N];
bool connnect(int x1, int y1, int x2, int y2, char c1, char c2) {
    if(x2 < 1 or x2 > n or y2 < 1 or y2 > n) return false;
    if(x[x2][y2] == -1) {
        d[x1][y1] = c1;
        if(d[x2][y2] == '\0') d[x2][y2] = c2;
        return true;
    } return false;
}
void dfs(int x1, int y1, char c1) {
    if(x1 < 1 or x1 > n or y1 < 1 or y1 > n) return;
    if(d[x1][y1] != '\0') return;

    d[x1][y1] = c1;
    if(x[x1][y1] == x[x1+1][y1] and y[x1+1][y1] == y[x1][y1])
        dfs(x1+1, y1, 'U');
    if(x[x1][y1] == x[x1-1][y1] and y[x1-1][y1] == y[x1][y1])
        dfs(x1-1, y1, 'D');
    if(x[x1][y1] == x[x1][y1-1] and y[x1][y1-1] == y[x1][y1])
        dfs(x1, y1-1, 'R');
    if(x[x1][y1] == x[x1][y1+1] and y[x1][y1+1] == y[x1][y1])
        dfs(x1, y1+1, 'L');
    return;
}
void taskD(){
    //int a1 = -1; cout << a1 << "  !a1 = " << !a1 << "  ~a1 = " << ~a1 << "\n";
    //a1 = 0;
     //cout << a1 << "  !a1 = " << !a1 << "  ~a1 = " << ~a1 << "\n";

    cin >> n;
    _rep(i,1,n) _rep(j,1,n)  cin >> x[i][j] >> y[i][j];
    _rep(i,1,n) _rep(j,1,n) {
        if(x[i][j] == -1) {
            bool flag = (d[i][j] != '\0');
            if(!flag) flag = connnect(i, j, i+1, j, 'D', 'U');
            if(!flag) flag = connnect(i, j, i-1, j, 'U', 'D');
            if(!flag) flag = connnect(i, j, i, j+1, 'R', 'L');
            if(!flag) flag = connnect(i, j, i, j-1, 'L', 'R');
            if(!flag) {cout << "INVALID\n"; return;}
        } else if(x[i][j] == i and y[i][j] == j) dfs(i, j, 'X');
    }

    //_rep(i,1,n) { _rep(j,1,n) cout << d[i][j]; cout << "\n";} cout << "ennnnn\n";
    
    _rep(i,1,n) _rep(j,1,n) 
        if(d[i][j] == '\0') {cout << "INVALID\n"; return;}
    cout << "VALID\n";
    _rep(i,1,n) { _rep(j,1,n) cout << d[i][j]; cout << "\n";}
    return;
}

const int N = 1e5+100;
ll dp[N][(1<<7)+5], s[N][8], a[N], idx[N];
bool cmp(int x, int y) {
    return a[x] > a[y];
}
void taskE(){
    int n, p, k; cin >> n >> p >> k;
    _rep(i,1,n)  cin >> a[i];
    _rep(i,1,n) _for(j,0,p) cin >> s[i][j];
    _rep(i,1,n) idx[i] = i;
    sort(idx+1, idx+n+1, cmp);
    memset(dp, -1, sizeof dp);
    dp[0][0] = 0;
    _rep(i,1,n) {
        int x = idx[i];
        _for(mask,0,(1<<p)) {   
            int ct = 0;
            _for(j,0,p) if(mask&(1<<j)) ct++;
            int z =  i-1-ct;
            if(z < k) {//观众席给个座位
                if(dp[i-1][mask] != -1)
                    dp[i][mask] = dp[i-1][mask]+a[x];
            } else {//满了
                if(dp[i-1][mask] != -1)
                    dp[i][mask] = dp[i-1][mask];
            }
            _for(j,0,p) if(mask&(1<<j) && dp[i-1][mask^(1<<j)] != -1)
                dp[i][mask] = max(dp[i][mask], dp[i-1][mask^(1<<j)]+s[x][j]);
    //前i-1个里面 去掉没有选第j个运动员的状态 转移到当前的选了第j的状态（将第i个人作为 第j个运动员)
        }
    }
    cout << dp[n][(1<<p)-1] << "\n";
    return;
}

int main(){
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    //taskA();
    //taskB1();
    //taskC();
    //taskD();
    taskE();
    return 0;
}