sf_女王购物

3

3 2

9 8

8 7

5 2

6 3

5 4

40 17 70 58

38 80 35 20

53 21 17 56

26 24 46 35

38 56 73 4

1 97 20 31

5 4

69 17 26 18

35 27 1 93

44 13 83 73

12 30 75 94

73 90 70 96

73 83 34 29

#1 20

#2 159

#3 248

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

import static java.lang.Integer.parseInt;
import static java.lang.Math.max;

public class Solution {
    private static final int[][] map = new int[105][20];
    private static final int[] fee = new int[20];
    private static final int[] min = new int[105];
    private static int N, M, ans;

    public static void main(String[] args) throws Exception {
       // System.setIn(new FileInputStream("c:\\tc\\eval_input.txt"));
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        long start = System.currentTimeMillis();
        int T = parseInt(br.readLine());
        for (int t = 1; t <= T; t++) {
            StringTokenizer st = new StringTokenizer(br.readLine());
            N = parseInt(st.nextToken());
            M = parseInt(st.nextToken());

            for (int i = 1; i <= N; i++) {
                st = new StringTokenizer(br.readLine());
                for (int j = 1; j <= M; j++) {
                    map[i][j] = parseInt(st.nextToken());
                }
            }
            st = new StringTokenizer(br.readLine());
            for (int j = 1; j <= M; j++) {
                fee[j] = parseInt(st.nextToken());
            }
            ans = Integer.MAX_VALUE;
            int cnt = (1 << M) - 1;
            while (cnt != 0) {
                int sum = 0;
                int used = cnt;
                Arrays.fill(min, Integer.MAX_VALUE >> 1);
                //System.out.println(Integer.toBinaryString(cnt) + " " + cnt);
                for (int i = 1; i <= M; i++) {

                    if (1 == (used & 1)) {
                        sum += fee[i];
                        for (int j = 1; j <= N; j++) {
                            min[j] = Math.min(min[j], map[j][i]);
                        }
                    }
                    used >>= 1;
                }
                for (int j = 1; j <= N; j++) {
                    sum += min[j];
                }
                ans = Math.min(ans, sum);
                cnt--;
            }
            System.out.println("#" + t + " " + ans);
        }
        //System.out.println("Time "+(System.currentTimeMillis()-start));

    }

}