Hey guys,

Given a collection of boxes. Return the max number of boxes that you can russian doll.
Each box has (w, h, l).

Example:

Input:

[
	[3,9,9],
	[1,4,10],
	[5,10,11],
	[3,9,3],
	[1,5,3]
	[7, 12, 1]
]

Output: 3
Explanation: [1,5,3] fits in [3,9,9] which fits in [5,10,11]
All the dimensions must be smaller to fit into a larger box -- [1,5,3] does not fit into [3,9,3]

This seems to be a variation of the known Box Stacking Problem.
May be similar to Russian Doll Envelopes question but harder with the extra dimension.