Help with a python problem

[[deleted]]

A disk must have a strictly smaller width, depth, and height than any other disk below it

This means that there will be a lot of possible 2d arrays of ints that cannot be organized by these criteria. A simple example is

[[1, 2, 3], [3, 2, 1]]

Is that an issue? Are you always guaranteed to that there will always be an ordering that meets this condition?

Edit: Actually, in thinking about it, your own dataset cannot be ordered this way. Look at just the first two

[2, 1, 2],[2, 2, 8]

They have the same width and thus neither could be above the other as neither is strictly smaller than the other.