CodeForces711C Coloring Trees

ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with integers from 1 to n from left to right.

Initially, tree i has color c_i. ZS the Coder and Chris the Baboon recognizes only m different colors, so 0 ≤ c_i ≤ m, where c_i = 0 means that tree i is uncolored.

ZS the Coder and Chris the Baboon decides to color only the uncolored trees, i.e. the trees with c_i = 0. They can color each of them them in any of the m colors from 1 to m. Coloring the i-th tree with color jrequires exactly p_i, j litres of paint.

The two friends define the beauty of a coloring of the trees as the minimum number of contiguous groups (each group contains some subsegment of trees) you can split all the n trees into so that each group contains trees of the same color. For example, if the colors of the trees from left to right are 2, 1, 1, 1, 3, 2, 2, 3, 1, 3, the beauty of the coloring is 7, since we can partition the trees into 7 contiguous groups of the same color : {2}, {1, 1, 1}, {3}, {2, 2}, {3}, {1}, {3}.

ZS the Coder and Chris the Baboon wants to color all uncolored trees so that the beauty of the coloring is exactly k. They need your help to determine the minimum amount of paint (in litres) needed to finish the job.

Please note that the friends can't color the trees that are already colored.

Input

The first line contains three integers, n, m and k (1 ≤ k ≤ n ≤ 100, 1 ≤ m ≤ 100) — the number of trees, number of colors and beauty of the resulting coloring respectively.

The second line contains n integers c₁, c₂, ..., c_n (0 ≤ c_i ≤ m), the initial colors of the trees. c_i equals to 0if the tree number i is uncolored, otherwise the i-th tree has color c_i.

Then n lines follow. Each of them contains m integers. The j-th number on the i-th of them line denotes p_i, j (1 ≤ p_i, j ≤ 10⁹) — the amount of litres the friends need to color i-th tree with color j. p_i, j's are specified even for the initially colored trees, but such trees still can't be colored.

Output

Print a single integer, the minimum amount of paint needed to color the trees. If there are no valid tree colorings of beauty k, print  - 1.

Example

Input

3 2 2
0 0 0
1 2
3 4
5 6

Output

10

Input

3 2 2
2 1 2
1 3
2 4
3 5

Output

-1

Input

3 2 2
2 0 0
1 3
2 4
3 5

Output

5

Input

3 2 3
2 1 2
1 3
2 4
3 5

Output

0

Note

In the first sample case, coloring the trees with colors 2, 1, 1 minimizes the amount of paint used, which equals to 2 + 3 + 5 = 10. Note that 1, 1, 1 would not be valid because the beauty of such coloring equals to 1 ({1, 1, 1} is a way to group the trees into a single group of the same color).

In the second sample case, all the trees are colored, but the beauty of the coloring is 3, so there is no valid coloring, and the answer is  - 1.

In the last sample case, all the trees are colored and the beauty of the coloring matches k, so no paint is used and the answer is 0.

f[i][j][k] : 前i个分了j块，其中第i个颜色为k时最小花费

思路十分正常的dp。。。

（转移方程太复杂辣不想再写一遍。。。）

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <cmath>

using namespace std;

typedef long long ll;

const int N = 110;

ll f[N][N][N];
int n, m, block, c[N], p[N][N];

int main() {
    scanf("%d%d%d", &n, &m, &block);
    for(int i = 1 ; i <= n ; i ++) {
        scanf("%d", &c[i]);
    }
    for(int i = 1 ; i <= n ; i ++) {
        for(int j = 1 ; j <= m ;j ++) {
            scanf("%d", &p[i][j]);
        }
    }
    memset(f, 0x3f, sizeof(f));
    if(c[1] == 0) {
        for(int i = 1 ; i <= m ; i ++) {
            f[1][1][i] = p[1][i];
        }
    } else {
        f[1][1][c[1]] = 0;
    }
    for(int i = 2 ; i <= n ; i ++) {
        for(int j = 1 ; j <= block ; j ++) {
            if(c[i] == 0) {
                for(int k = 1 ; k <= m ; k ++) {
                    f[i][j][k] = f[i - 1][j][k] + p[i][k];
                    for(int l = 1 ; l <= m ; l ++) {
                        if(k != l) {
                            f[i][j][k] = min(f[i][j][k], f[i - 1][j - 1][l] + p[i][k]);
                        }
                    }
                }
            } else {
                f[i][j][c[i]] = f[i - 1][j][c[i]];
                for(int k = 1 ; k <= m ; k ++) {
                    if(c[i] != k) {
                        f[i][j][c[i]] = min(f[i][j][c[i]], f[i - 1][j - 1][k]);
                    }
                }
            }
        }
    }
    ll ans = 0x3f3f3f3f3f3f3f3f;
    for(int i = 1 ; i <= m ; i ++) {
        ans = min(ans, f[n][block][i]);
    }
    printf("%lld\n", ans == 0x3f3f3f3f3f3f3f3f ? -1 : ans);
}