3218. Minimum Cost for Cutting Cake I

There is an m x n cake that needs to be cut into 1 x 1 pieces. You are given integers m, n, and two arrays: - horizontalCut of size m - 1, where horizontalCut[i] represents the cost to cut along the horizontal line i. - verticalCut of size n - 1, where verticalCut[j] represents the cost to cut along the vertical line j. In one operation, you can choose any piece of cake that is not yet a 1 x 1