Page not loading? Try clicking here.
Placeholder

#10428

Weightlifting 20s 1024MB

Problems

You are following a prescribed training for weightlifting. The training consists of a series of exercises that you must do in order. Each exercise requires a specific set of weights to be placed on a machine.

There are \mathbf{W} types of different weights. For example, an exercise may require 3 weights of type A and 1 weight of type B, while the next requires 2 weights each of types A, C, and D.

Weightlifting example.

The weights are placed on the machine as a stack. Formally, with a single operation, you can either add a new weight of any type to the top of the stack, or remove the weight that is currently at the top of the stack.

You can load the weights for each exercise onto the machine's stack in any order. So, if you place the weight of type B at the bottom in the first exercise of the example above, you will have to take all the weights off before putting on the weights for the second exercise. On the other hand, if you place the weight of type B third from the bottom, you can leave two of the weights of type A on the bottom of the stack to be part of the next exercise's set, saving you some time.

Given the amount of weights of each type needed for each exercise, find the minimum number of operations needed to do them all. You must complete the exercises in the order given. The machine stack starts out empty, and you must leave it empty after you finish with all your exercises.


Input

The first line of the input gives the number of test cases, \mathbf{T}. \mathbf{T} test cases follow. Each test case starts with a line containing 2 integers \mathbf{E} and \mathbf{W}: the number of exercises and the number of types of weights. Weight types are numbered between 1 and \mathbf{W}. Then, \mathbf{E} lines follow. The i-th of these lines contains \mathbf{W} integers \mathbf{X_{i,1}}, \mathbf{X_{i,2}}, \dots, \mathbf{X_{i,W}} representing that the i-th exercise requires exactly \mathbf{X_{i,j}} weights of type j.


Output

For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1) and y is the minimum number of machine stack operations needed to run through all your exercises.


Example 

3
3 1
1
2
1
2 3
1 2 1
2 1 2
3 3
3 1 1
3 3 3
2 3 3
Case #1: 4
Case #2: 12
Case #3: 20
In Sample Case #1, there is only one type of weight. The first exercise needs 1 weight, the second needs 2 weights, and the third needs 1 weight. You can complete the exercise in 4 operations as follows: Add a weight onto the stack. You do the first exercise. Add a weight onto the stack. You do the second exercise. Remove a weight from the top of the stack. You do the third exercise. Remove a weight from the top of the stack. Now the stack becomes empty. In Sample Case #2, one way to complete the exercises in 12 operations is as follows: Add a weight of type 2. Add a weight of type 3. Add a weight of type 1. Add a weight of type 2. Now the stack contains weights of types 2, 3, 1, 2 from bottom to top. You do the first exercise. Remove a weight of type 2 from the top of the stack. Add a weight of type 3. Add a weight of type 1. Now the stack contains weights of types 2, 3, 1, 3, 1 from bottom to top. You do the second exercise. Remove a weight of type 1 from the top of the stack. Remove a weight of type 3 from the top of the stack. Remove a weight of type 1 from the top of the stack. Remove a weight of type 3 from the top of the stack. Remove a weight of type 2 from the top of the stack. Now the stack becomes empty.

Source

GCJ 2022r1a C

You must sign in to write code.