P3024 [USACO11OPEN] Cow Checkers S

One day, Bessie decides to challenge Farmer John to a game of 'Cow Checkers'. The game is played on an M\*N (1

\* Line 1: Two space-separated integers: M and N \* Line 2: A single integer: T \* Lines 3..T+2: Two space-separated integers: X and Y

\* Lines 1..T: Should contain either 'Farmer John' or 'Bessie' depending on who wins each game.

Farmer John and Bessie are playing one game on a 3\*3 checkerboard with the checker piece initially at (1, 1) (i.e. at the center of the board). Bessie initially can only move the checker piece to either (1, 0) or (0, 1), or (0, 0). Bessie can immediately win by moving the piece to (0, 0).