#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;

class Solution {
public:
    int minCost(vector<int>& houses, vector<vector<int> >& cost, int m, int n, int target);
};

int Solution::DP(int index, int t, int prev)
{
  return 0;
}

int main()
{
  int m, n, t;
  int i, j, k;
  vector <int> h;
  vector < vector <int> > c;
  Solution s;

  cin >> m >> n >> t;
  h.resize(m);
  c.resize(m);
  for (i = 0; i < m; i++) c[i].resize(n);
  for (i = 0; i < m; i++) cin >> h[i];
  for (i = 0; i < m; i++) for (j =0; j < n; j++) cin >> c[i][j];

  cout << s.minCost(h, c, m, n, t) << endl;

  return 0;
}