Java console application outputs n x m chess board cell combinations to allocate k non-attacking figures

Output example

n m k figure f - find n x m chess board cell combinations to allocate k non-attacking figures f
export - create a txt-file in the current folder with last calculation result
exit - close the program
3 2 2 knight
searching 3 x 2 chess board cell combinations to allocate 2 non-attacking knights...
13 combinations have been found in 27 milliseconds
[(1, 0), (0, 0)]
0 0 0
1 1 0

[(1, 0), (1, 1)]
0 1 0
0 1 0

[(2, 1), (1, 1)]
0 1 1
0 0 0

[(0, 0), (1, 1)]
0 1 0
1 0 0

[(1, 0), (0, 1)]
1 0 0
0 1 0

[(2, 1), (0, 1)]
1 0 1
0 0 0

[(0, 0), (0, 1)]
1 0 0
1 0 0

[(1, 1), (0, 1)]
1 1 0
0 0 0

[(1, 0), (2, 0)]
0 0 0
0 1 1

[(2, 1), (2, 0)]
0 0 1
0 0 1

[(0, 0), (2, 0)]
0 0 0
1 0 1

[(1, 1), (2, 0)]
0 1 0
0 0 1

[(1, 0), (2, 1)]
0 0 1
0 1 0

n m k figure f - find n x m chess board cell combinations to allocate k non-attacking figures f
export - create a txt-file in the current folder with last calculation result
exit - close the program
export
calculation result has been exported to txt-file /Users/kotovsergey/Documents/chess/chess_calculation_result_1565382654140.txt
n m k figure f - find n x m chess board cell combinations to allocate k non-attacking figures f
export - create a txt-file in the current folder with last calculation result
exit - close the program
exit