Castle and the girls
A castle has a square shape, and along each side it has three rooms.
How can we accommodate n girls in the rooms of the castle such that all of the following are fulfilled:
1) the numbers of girls in each side the of the squares are equal;
2) each room contains at most m girls
3) the numbers of girls in the rooms on the corners of the square are equal.
Input description: You will be given two integers n and m (1<=n<=1.000 and 1<=m<=100)
Output description: You will output in the given format the possible ways to accommodate the girls, or “Impossible” if it’s not possible.
Sample 1
Sample 2
Input:
16 5
60 1
Output:
[1, 2, 1]
[2, 4, 2]
[1, 3, 1]
[3, 0, 3]
[2, 1, 2]
[1, 4, 1]
[2, 2, 2]
[2, 0, 2]
[0, 4, 0]
[3, 1, 3]
[1, 0, 1]
[4, 0, 4]
[0, 0, 0]
Impossible