Squares#10138
You are tasked with filling each cell of an N \times N square table with either a zero or a one. The goal is to ensure that every K \times K sub-square within the table contains exactly ones.
The first line of input consists of three integers: , , (1 \leq N \leq 100, 1 \leq K \leq N, 0 \leq S \leq K^2).
Print the completed table. Each number in a row should be separated by a space, and each row should be printed on a new line. If there are multiple valid solutions, you may output any one of them.
Example 1