Irving & Cohen Petroleum Corporation has decided to develop a new oil field in an area. A preliminary survey has been done and they created a detailed grid map of the area which indicates the reserve of oil.

They are now planning to construct mining plants on several grid blocks according this map, but they decided not to place any two plants on adjacent positions to avoid spreading of fire in case of blaze. Two blocks are considered to be adjacent when they have a common edge. You are one of the programmers working for the company and your task is to write a program which calculates the maximum amount of oil they can mine, given the map of the reserve.



Input

The first line of the input specifies N, the number of test cases. Then N test cases follow, each of which looks like the following:


W H
r1,1 r2,1 . . . rW,1
...
r1,H r2,H . . . rW,H


The first line of a test case contains two integers W and H (1 ≤ W, H ≤ 20). They specifies the dimension of the area. The next H lines, each of which contains W integers, represent the map of the area. Each integer rx,y (0 ≤ rx,y < 10000) indicates the oil reserve at the grid block (x, y).

Output

For each test case, output the case number (starting from 1) and the maximum possible amount of mining in a line. Refer to the sample output section about the format.

Example

Input

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


Output

Case 1: 7
Case 2: 8
#include <bits/stdc++.h>
using namespace std;
struct Dinic {
  const int INF = 1 << 28;
  struct edge {
    int to, cap, rev;
    edge() {}
    edge(int to, int cap, int rev) : to(to), cap(cap), rev(rev) {}
  };
  int n;
  vector<vector<edge> > G;
  vector<map<int, int> > M;
  vector<int> level, iter;
  Dinic() {}
  Dinic(int sz) : n(sz), G(n), M(n), level(n), iter(n) {}
  void add_edge(int from, int to, int cap) {
    M[from][to] = G[from].size();
    M[to][from] = G[to].size();
    G[from].push_back(edge(to, cap, G[to].size()));
    G[to].push_back(edge(from, 0, G[from].size() - 1));
  }
  void bfs(int s) {
    fill(level.begin(), level.end(), -1);
    queue<int> que;
    level[s] = 0;
    que.push(s);
    while (!que.empty()) {
      int v = que.front();
      que.pop();
      for (int i = 0; i < (int)G[v].size(); i++) {
        edge &e = G[v][i];
        if (e.cap > 0 && level[e.to] < 0) {
          level[e.to] = level[v] + 1;
          que.push(e.to);
        }
      }
    }
  }
  int dfs(int v, int t, int f) {
    if (v == t) return f;
    for (int &i = iter[v]; i < (int)G[v].size(); i++) {
      edge &e = G[v][i];
      if (e.cap > 0 && level[v] < level[e.to]) {
        int d = dfs(e.to, t, min(f, e.cap));
        if (d > 0) {
          e.cap -= d;
          G[e.to][e.rev].cap += d;
          return d;
        }
      }
    }
    return 0;
  }
  int flow(int s, int t, int lim) {
    int fl = 0;
    for (;;) {
      bfs(s);
      if (level[t] < 0 || lim == 0) return fl;
      fill(iter.begin(), iter.end(), 0);
      int f;
      while ((f = dfs(s, t, lim)) > 0) {
        fl += f;
        lim -= f;
      }
    }
  }
  int flow(int s, int t) { return flow(s, t, INF); }
  bool back_edge(int s, int t, int from, int to) {
    for (int i = 0; i < (int)G[from].size(); i++) {
      edge &e = G[from][i];
      if (e.to == to) {
        if (e.cap == 0 && flow(from, to, 1) == 0) {
          flow(from, s, 1);
          flow(t, to, 1);
          return 1;
        }
      }
    }
    return 0;
  }
};
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, -1, 1};
int main() {
  int test;
  cin >> test;
  for (int o = 0; o < test; o++) {
    int h, w, sum = 0;
    cin >> h >> w;
    int a[h][w];
    for (int i = 0; i < h; i++)
      for (int j = 0; j < w; j++) cin >> a[i][j], sum += a[i][j];
    Dinic D(h * w + 2);
    int SRC = h * w;
    int SINK = h * w + 1;
    for (int i = 0; i < h; i++) {
      for (int j = 0; j < w; j++) {
        if ((i + j) % 2 == 0) {
          D.add_edge(SRC, i * w + j, a[i][j]);
          for (int k = 0; k < 4; k++) {
            int y = i + dy[k];
            int x = j + dx[k];
            if (y < 0 || x < 0 || y >= h || x >= w) continue;
            D.add_edge(i * w + j, y * w + x, 1e8);
          }
        } else
          D.add_edge(i * w + j, SINK, a[i][j]);
      }
    }
    cout << "Case " << o + 1 << ": " << sum - D.flow(SRC, SINK, 1e8) << endl;
  }
}
