Problem: Alice, the president of club FCB, wants to build a team for the new volleyball tournament. The team should consist of p players playing in p different positions. She also recognizes the importance of audience support, so she wants to select k people as part of the audience.

There are n people in Byteland. Alice needs to select exactly p players, one for each position, and exactly k members of the audience from this pool of n people. Her ultimate goal is to maximize the total strength of the club.

The i-th of the n persons has an integer a_{i} associated with him — the strength he adds to the club if he is selected as a member of the audience.

For each person i and for each position j, Alice knows s_{i, j} — the strength added by the i-th person to the club if he is selected to play in the j-th position.

Each person can be selected at most once as a player or a member of the audience. You have to choose exactly one player for each position.

Since Alice is busy, she needs you to help her find the maximum possible strength of the club that can be achieved by an optimal choice of players and the audience.

Input

The first line contains 3 integers n,p,k (2 ≤ n ≤ 10^{5}, 1 ≤ p ≤ 7, 1 ≤ k, p+k ≤ n).

The second line contains n integers a_{1},a_{2},…,a_{n}. (1 ≤ a_{i} ≤ 10^{9}).

The i-th of the next n lines contains p integers s_{i, 1}, s_{i, 2}, ..., s_{i, p}. (1 ≤ s_{i,j} ≤ 10^{9})

Output

Print a single integer {res} — the maximum possible strength of the club.

Examples

Input


4 1 2
1 16 10 3
18
19
13
15


Output


44


Input


6 2 3
78 93 9 17 13 78
80 97
30 52
26 17
56 68
60 36
84 55


Output


377


Input


3 2 1
500 498 564
100002 3
422332 2
232323 1


Output


422899

Note

In the first sample, we can select person 1 to play in the 1-st position and persons 2 and 3 as audience members. Then the total strength of the club will be equal to a_{2}+a_{3}+s_{1,1}.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int inf = 0x3f3f3f3f;
const long long linf = 0x3f3f3f3f3f3f3f3f;
const long long mod = 1e9 + 7;
const double eps = 1e-6;
long long a[maxn], s[maxn][10];
long long dp1[maxn][(1 << 7) + 5], dp2[maxn][(1 << 7) + 5];
struct node {
  int id;
  long long w;
  bool operator<(const node &rhs) const { return w > rhs.w; }
} nd[maxn];
long long pre[maxn];
int main() {
  int n, p, k;
  scanf("%d%d%d", &n, &p, &k);
  for (int i = 1; i <= n; ++i) {
    scanf("%lld", &a[i]);
    nd[i] = {i, a[i]};
  }
  sort(nd + 1, nd + n + 1);
  pre[0] = 0;
  for (int i = 1; i <= n; ++i) {
    pre[i] = pre[i - 1] + nd[i].w;
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < p; ++j) {
      scanf("%lld", &s[i][j]);
    }
  }
  int mx = (1 << p);
  for (int j = 0; j < mx; ++j) {
    dp1[0][j] = -linf;
  }
  dp1[0][0] = 0;
  for (int i = 1; i <= p + k; ++i) {
    for (int j = 0; j < mx; ++j) {
      dp1[i][j] = dp1[i - 1][j];
    }
    const int &id = nd[i].id;
    for (int j = 0; j < mx; ++j) {
      int val = dp1[i - 1][j];
      if (val == -linf) continue;
      for (int k = 0; k < p; ++k) {
        int mask = (1 << k);
        if ((mask & j) != 0) continue;
        int nxtMask = (mask | j);
        long long nxtDP = dp1[i - 1][j] + s[id][k] - a[id];
        dp1[i][nxtMask] = max(nxtDP, dp1[i][nxtMask]);
      }
    }
  }
  for (int i = p + k + 1; i <= n; ++i) {
    for (int j = 0; j < mx; ++j) {
      if (i > p + k + 1) {
        dp2[i][j] = dp2[i - 1][j];
      } else {
        dp2[i][j] = -linf;
      }
    }
    dp2[i][0] = max(0LL, dp2[i][0]);
    const int &id = nd[i].id;
    for (int j = 0; j < mx; ++j) {
      int val = dp2[i - 1][j];
      if (val == -linf) continue;
      for (int k = 0; k < p; ++k) {
        int mask = (1 << k);
        if ((mask & j) != 0) continue;
        int nxtMask = (mask | j);
        long long nxtDP = dp2[i - 1][j] + s[id][k];
        dp2[i][nxtMask] = max(nxtDP, dp2[i][nxtMask]);
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i < mx; ++i) {
    int cnt = __builtin_popcount(i);
    long long val = pre[k + cnt];
    if (dp1[k + cnt][i] == -linf) {
      continue;
    }
    val += dp1[k + cnt][i];
    if (p + k == n) {
      if (cnt != p) {
        continue;
      }
    } else {
      int mask = (mx - 1) - i;
      if (dp2[n][mask] == -linf) {
        continue;
      }
      val += dp2[n][mask];
    }
    if (val >= ans) {
      ans = val;
    }
  }
  printf("%lld\n", ans);
  return 0;
}