So, I was solving problems for interview prepartion and I came across this question below:\n\n**Description**\nAn n*m rectangular cake with k strawberries. Now cut the cake so that there is one on each cake (which means you can\'t cut the cake without strawberries), and you can only cut it horizontally or Cut vertically to find the shortest cut length.\n\n\n**Note:**\n```\nn, m do not exceed 20\nThe two-dimensional array mp is the coordinates of the k strawberry.\n```\n\n**Examples:**\n```\nExample 1:\n\nInput: n = 3, m = 4, k = 3, mp = [[1, 2], [2, 3], [3, 2]]\nOutput: 5\nExplanation:\nCut vertically in the middle and cut half of the cake with 2 strawberries.\n\nExample 2:\n\nInput: n = 2, m = 2, k = 2, mp = [[1, 1], [2, 2]]\nOutput: 2\nExplanation:\nCut vertically in the middle.\n```\n\nI\'m not able to think any approach for this problem. Can someone help me?

So, I was solving problems for interview prepartion and I came across this question below:\n\nDescription\nAn nm rectangular cake with k strawberries. Now cut t