## ABCPATH - ABC Path

You will be given a 2-dimensional grid of letters. Find the length of the longest path of consecutive letters, starting at 'A'. Paths can step from one letter in the grid to any adjacent letter (horizontally, vertically, or diagonally).

For example, in the following grid, there are several paths from 'A' to 'D', but none from 'A' to 'E':

One such path is:

### Input

Each test case will start with a line contains two integers H, W the height and width of the grid respectively 1 <= H, W <= 50. Then H lines follow each of W uppercase letters only. Input terminates with H = 0 and W = 0.

### Output

For each test case print `“Case C: X”` without quotes where C is the case number starting with 1 and X is the solution.

### Example

Sample Input:4 3 ABE CFG BDH ABC 0 0Sample Output:Case 1: 4

Added by: | Ali Arous |

Date: | 2011-11-05 |

Time limit: | 1s |

Source limit: | 50000B |

Memory limit: | 1536MB |

Cluster: | Cube (Intel G860) |

Languages: | All except: ASM64 |

Resource: | FCIS Local Contest 2012 |