Given an arranged chess board with pieces, figure out the total number of different ways in which any piece can be killed in one move. Note: in this problem, the pieces can be killed despite of the color.
:::align{center}
:::
For example, if there are pieces King is at B2, Pawn at A1 and Queen at H8 then the total number of pieces that an be killed is . H8-Q can kill B2-K, A1-P can kill B2-K, B2-K can kill A1-P
A position on the chess board is represented as A1, A2... A8,B1.. H8
Pieces are represented as
(K) King can move in direction by one place.
(Q) Queen can move in direction by any number of places, but can't overtake another piece.
(R) Rook can only move vertically or horitonally, but can't overtake another piece.
(B) Bishop can only move diagonally, but can't overtake another piece.
(N) Knights can move to a square that is two squares horizontally and one square vertically OR one squares horizontally and two square vertically.
(P) Pawn can only kill by moving diagonally upwards (towards higher number i.e. A -> B, B->C and so on).
输入格式
The first line of the input gives the number of test cases, . Test cases follow. Each test case consists of the number of pieces , . lines follow, each line mentions where a piece is present followed by - with the piece type
输出格式
For each test case, output one line containing "Case #x: y", where is the test case number (starting from ) and is the the total number of different ways in which any piece can be killed.
:::