Chess Scenario

Black to move and win.

Give the coordinates $(x_1 \times y_1)$ of the 2nd move $\times$ the least amount of moves black can checkmate white (assuming both side play optimally) as your answer. The upper right coordinate is $(1,1)$

Try not to use a chess engine when solving this problem!