Leetcode 3560. Find Minimum Log Transportation Cost

Given two logs of lengths n and m and three trucks each with capacity k, minimize the total cost of cutting the logs (splitting x into len1 and len2 costs len1*len2) so that the resulting pieces (at most three) all have length ≤ k.