If one of the dimensions becomes one, do we continue with an (k-1)-dimensional problem, or does every cut remove all blocks?

In either case, can someone give me some sample I/O, since I currently get WA #3 (assuming the first two are the sample cases).

Second way, k is constant during computations.
Finally, some tests:
2
11 12
3
6 7 8
4
5 6 7 8

and answers:
1
4 1
1
1 2 4
1
1 1 2 4

Thanks, I've found my stupid error (using a global variable in an recursive function). Now I got TLE on test 4, but I'll work on that later.

Consider case K = 1 severally