We are given an integer K and a square board of size nxn, that is partially filled with 1s and empty cells are denoted as 0s and we need to fill the board according to the following rules
- 1s Represent Queens on the chess board
- We need to put K queens on the board including the ones aldready there, such that no queen attacks any other queen
- Queens already on the board cannot be removed
- Two Queens can attack each other if they are in the same row, column or in the same diagonal (any 45 degree line, not necessarily the main diagonals)