Limits: 1s, 512 MB
Let there be a chessboard of size N×M, and only one bishop in a cell (x, y). How many cells can the bishop can attack in one move? You can assume that one possible move is staying in the current position.
This is a companion discussion topic for the original entry at https://toph.co/p/gutibaji-on-chessboard