Write a program that first reads the positions of a number of pieces

on a chess board and then reads the location of another position. A

piece can attack a position if it can move into that position. Your

program should determine which of the pieces can attack the given

position.

Chess is played on an $88$ board whose rows are numbered from

$1$ to $8($from the bottom to the top$)$ and whose columns are lettered

from a to $h($from left to right$).$ In this problem you are only going

to be dealing with the following pieces:

King $($K$)$: can move one space in any direction

Queen $($Q$)$: can move any number of spaces in any direction

Rook $($R$)$: can move any number of spaces, either horizontally

or vertically

Bishop $($B$)$: can move any number of spaces diagonally

Knight $($N$)$: can move two spaces vertically followed by one space

horizontally or two spaces horizontally followed by one space

vertically

The program should read the position of a piece by reading the piece

code, the column, and the row in that order, one character at a time.

It should continue to read the positions of pieces until the piece code

is X$,$ indicating the position to be attacked. Assume that all input is

valid.