#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
struct node {
  long long x, s[8];
  int id;
} a[N];
int n, p, t;
long long f[N][(1 << 8) + 5];
bool cmp(node a, node b) { return a.x > b.x; }
int main() {
  scanf("%d%d%d", &n, &p, &t);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i].x);
    a[i].id = i;
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= p; j++) scanf("%lld", &a[i].s[j]);
  sort(a + 1, a + n + 1, cmp);
  memset(f, -1, sizeof(f));
  f[0][0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < (1 << p); j++) {
      f[i][j] = f[i - 1][j];
      int sum = 0;
      for (int k = 0; k < p; k++)
        if (j & (1 << k)) sum++;
      int tmp = i - 1 - sum;
      if (tmp < t && f[i - 1][j] != -1) f[i][j] += a[i].x;
      for (int k = 0; k < p; k++) {
        if (((j & (1 << k))) && f[i - 1][j ^ (1 << k)] != -1)
          f[i][j] = max(f[i][j], f[i - 1][j ^ (1 << k)] + a[i].s[k + 1]);
      }
    }
  }
  printf("%lld", f[n][(1 << p) - 1]);
  return 0;
}
