#include <bits/stdc++.h>
using namespace std;
clock_t start;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
template <typename T1, typename T2>
istream& operator>>(istream& in, pair<T1, T2>& q) {
  in >> q.first >> q.second;
  return in;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2>& q) {
  out << q.first << " " << q.second;
  return out;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(pair<T1, T2> p1, pair<T1, T2> p2) {
  return {p1.first + p2.first, p1.second + p2.second};
}
template <typename T1, typename T2>
pair<T1, T2> operator-(pair<T1, T2> p1, pair<T1, T2> p2) {
  return {p1.first - p2.first, p1.second - p2.second};
}
const long long N = 1e5 + 1;
vector<long long> a[N];
long long dp[N][(1 << 7)];
bool cmp(vector<long long> v1, vector<long long> v2) { return v1[0] > v2[0]; }
void solve() {
  long long n, p, k;
  cin >> n >> p >> k;
  for (long long i = 1; i <= n; i++) {
    a[i].resize(p + 1);
    cin >> a[i][0];
  }
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= p; j++) cin >> a[i][j];
  }
  sort(a + 1, a + n + 1, cmp);
  for (long long mask = 0; mask < (1 << p); mask++) {
    long long len = __builtin_popcountll(mask);
    for (long long j = 1; j <= n; j++) {
      if (j == len) {
        for (long long k = 0; k < p; k++) {
          if (!((mask >> k) & 1)) continue;
          dp[j][mask] =
              max(dp[j][mask], dp[j - 1][mask ^ (1 << k)] + a[j][k + 1]);
        }
      } else if (j <= k + len && j > len) {
        dp[j][mask] = dp[j - 1][mask] + a[j][0];
        for (long long k = 0; k < p; k++) {
          if (!((mask >> k) & 1)) continue;
          dp[j][mask] =
              max(dp[j][mask], dp[j - 1][mask ^ (1 << k)] + a[j][k + 1]);
        }
      } else if (j > len) {
        dp[j][mask] = dp[j - 1][mask];
        for (long long k = 0; k < p; k++) {
          if (!((mask >> k) & 1)) continue;
          dp[j][mask] =
              max(dp[j][mask], dp[j - 1][mask ^ (1 << k)] + a[j][k + 1]);
        }
      }
    }
  }
  cout << dp[n][(1 << p) - 1] << '\n';
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  start = clock();
  cout << fixed << setprecision(15);
  while (t--) {
    solve();
  }
  double time_taken = double(clock() - start) / double(CLOCKS_PER_SEC);
  cerr << time_taken;
}
