#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int M = (1 << 7);
const int mod = 1e9 + 7;
long long dp[N][M];
struct node {
  int v, s[8];
} a[N];
bool cmp(node b, node d) { return b.v > d.v; }
int n, p, k;
int main() {
  scanf("%d%d%d", &n, &p, &k);
  int st = 1 << p;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i].v);
  for (int i = 1; i <= n; i++)
    for (int j = 0; j < p; j++) scanf("%d", &a[i].s[j]);
  sort(1 + a, 1 + a + n, cmp);
  for (int i = 0; i <= n; i++)
    for (int j = 1; j < st; j++) dp[i][j] = -1e18;
  dp[0][0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < st; j++) {
      for (int k = 0; k < p; k++)
        if (j & (1 << k))
          dp[i][j] = max(dp[i - 1][j - (1 << k)] + a[i].s[k], dp[i][j]);
      int p = __builtin_popcount(j);
      if ((i - 1) - p >= k)
        dp[i][j] = max(dp[i][j], dp[i - 1][j]);
      else
        dp[i][j] = max(dp[i][j], dp[i - 1][j] + a[i].v);
    }
  }
  printf("%lld\n", dp[n][st - 1]);
}
