Putting Blocks in Boxes Untill th height is met Using Dynamic Programming

I am pretty new in the field of DP. My friend recently gave me a question from one of his old assignments to solve and practice and I am stuck at it.

The question says:

Given n blocks of same height and width but the different thickness and list B = (b_1, . . . , b_n) of the thickness of the block, define a DP algorithm to fit all the blocks in k boxes where each box can fit t thickness of blocks at most.

I was thinking of putting as many blocks in the first 2 boxes and the third one will be filled with the left blocks. But I have no idea how to break it down into the subproblems and create the base cases to define the time required. Any help will be appreciated. The given time complexity is O(nt^2).

Thanks!