2442N/A

2442N/Aimport java.util.*;

2442N/Aimport java.io.*;

2442N/Aimport java.util.regex.*;

2442N/A

2442N/Apublic class Test6890943 {

2442N/A public static final boolean AIR = true, ROCK = false;

2442N/A public static void main(String[] args) {

2442N/A new Test6890943().go();

2442N/A }

2442N/A

2442N/A int r, c, f, t;

2442N/A boolean[][] grid;

2442N/A

2442N/A public void go() {

2442N/A Scanner s = new Scanner(System.in);

2442N/A s.useDelimiter("\\s+");

2442N/A int T = s.nextInt();

2442N/A for (t = 0 ; t < T ; t++) {

2442N/A r = s.nextInt(); c = s.nextInt(); f = s.nextInt();

2442N/A grid = new boolean[r][c];

2442N/A for (int x = 0 ; x < r ; x++) {

2442N/A String line = s.next();

2442N/A for (int y = 0 ; y < c ; y++) grid[x][y] = line.charAt(y) == '.';

2442N/A }

2442N/A int digs = solve();

2442N/A String res = digs == -1 ? "No" : "Yes " + digs;

2442N/A System.out.printf("Case #%d: %s\n", t+1, res);

2442N/A }

2442N/A }

2442N/A

2442N/A Map<Integer, Integer> M = new HashMap<Integer, Integer>();

2442N/A

2442N/A private int solve() {

2442N/A M = new HashMap<Integer, Integer>();

2442N/A M.put(calcWalkingRange(0, 0), 0);

2442N/A for (int digDown = 0 ; digDown < r ; digDown++) {

2442N/A Map<Integer, Integer> tries = new HashMap<Integer, Integer>();

2442N/A for (Map.Entry<Integer, Integer> m : M.entrySet()) {

2442N/A int q = m.getKey();

2442N/A if (depth(q) != (digDown)) continue;

2442N/A if (stuck(q)) continue;

2442N/A tries.put(q, m.getValue());

2442N/A }

2442N/A

2442N/A for (Map.Entry<Integer, Integer> m : tries.entrySet()) {

2442N/A int q = m.getKey();

2442N/A int fallLeftDelta = 0, fallRightDelta = 0;

2442N/A //fall left

2442N/A int fallLeft = fall(digDown, start(q));

2442N/A if (fallLeft > 0) {

2442N/A fallLeftDelta = 1;

2442N/A if (fallLeft <= f) addToM(calcWalkingRange(digDown+fallLeft, start(q)), m.getValue());

2442N/A }

2442N/A

2442N/A //fall right

2442N/A int fallRight = fall(digDown, end(q));

2442N/A if (fallRight > 0) {

2442N/A fallRightDelta = 1;

2442N/A

2442N/A if (fallRight <= f) addToM(calcWalkingRange(digDown+fallRight, end(q)), m.getValue());

2442N/A }

2442N/A

2442N/A for (int p = start(q) + fallLeftDelta ; p <= end(q) - fallRightDelta ; p++) {

2442N/A //goLeft

2442N/A for (int digSpot = p ; digSpot > start(q) +fallLeftDelta ; digSpot--) {

2442N/A int fallDown = 1+fall(digDown+1, digSpot);

2442N/A if (fallDown <= f) {

2442N/A if (fallDown == 1) {

2442N/A addToM(calcWalkingRange(digDown + 1, digSpot, digSpot, p), m.getValue() + Math.abs(digSpot-p)+1);

2442N/A } else {

2442N/A addToM(calcWalkingRange(digDown + fallDown, digSpot), m.getValue() + Math.abs(digSpot-p)+1);

2442N/A }

2442N/A }

2442N/A }

2442N/A

2442N/A //goRight

2442N/A for (int digSpot = p ; digSpot < end(q)-fallRightDelta ;digSpot++) {

2442N/A int fallDown = 1+fall(digDown+1, digSpot);

2442N/A if (fallDown <= f) {

2442N/A if (fallDown == 1) {

2442N/A addToM(calcWalkingRange(digDown + 1, digSpot, p, digSpot), m.getValue() + Math.abs(digSpot-p)+1);

2442N/A } else {

2442N/A addToM(calcWalkingRange(digDown + fallDown, digSpot), m.getValue() + Math.abs(digSpot-p)+1);

2442N/A }

2442N/A }

2442N/A }

2442N/A }

2442N/A }

2442N/A }

2442N/A

2442N/A int result = Integer.MAX_VALUE;

2442N/A for (Map.Entry<Integer, Integer> m : M.entrySet()) {

2442N/A if (depth(m.getKey()) == r-1) result = Math.min(m.getValue(), result);

2442N/A }

2442N/A

2442N/A if (result == Integer.MAX_VALUE) return -1;

2442N/A return result;

2442N/A }

2442N/A

2442N/A private void addToM(int q, int i) {

2442N/A Integer original = M.get(q);

2442N/A if ( original == null ) M.put(q, i);

2442N/A else M.put(q, Math.min(original, i));

2442N/A }

2442N/A

2442N/A private int fall(int row, int column) {

2442N/A int res = 0;

2442N/A for ( int p = row+1 ; p < r ; p++) {

2442N/A if (grid[p][column] == AIR) res++;

2442N/A else break;

2442N/A }

2442N/A return res;

2442N/A }

2442N/A

2442N/A private boolean stuck(int q) {

2442N/A return start(q) == end(q);

2442N/A }

2442N/A

2442N/A private int depth(int q) {

2442N/A return q % 50;

2442N/A }

2442N/A

2442N/A private int start(int q) {

2442N/A return q / (50*50);

2442N/A }

2442N/A

2442N/A private int end(int q) {

2442N/A return (q / 50) % 50;

2442N/A }

2442N/A

2442N/A private int calcWalkingRange(int depth, int pos) {

2442N/A return calcWalkingRange(depth, pos, Integer.MAX_VALUE, Integer.MIN_VALUE);

2442N/A }

2442N/A

2442N/A private int calcWalkingRange(int depth, int pos, int airOverrideStart, int airOverrideEnd) {

2442N/A int left = pos, right = pos;

2442N/A if (depth >= r) return (c-1)*50 + depth;

2442N/A

2442N/A while (left > 0) {

2442N/A if (grid[depth][left-1] == ROCK && (left-1 < airOverrideStart || left-1 > airOverrideEnd)) break;

2442N/A if (depth < r-1 && grid[depth+1][left-1] == AIR) {

2442N/A left--;

2442N/A break;

2442N/A }

2442N/A left--;

2442N/A }

2442N/A while (right < c-1) {

2442N/A if (grid[depth][right+1] == ROCK && (right+1 < airOverrideStart || right+1 > airOverrideEnd)) break;

2442N/A if (depth < r-1 && grid[depth+1][right+1] == AIR) {

2442N/A right++;

2442N/A break;

2442N/A }

2442N/A right++;

2442N/A }

2442N/A

2442N/A return left *50*50 + right*50 + depth;

2442N/A }

2442N/A}