3473. Sum of K Subarrays With Length at Least M

You are given an integer array nums and two integers, k and m. Return the maximum sum of k non-overlapping subarrays of nums, where each subarray has a length of at least m. Example 1: Input: nums = [1,2,-1,3,3,4], k = 2, m = 2 Output: 13 Explanation: The optimal choice is: - Subarray nums[3..5] with sum 3 + 3 + 4 = 10 (length is 3 >= m). - Subarray nums[0..1] with sum 1 + 2 = 3 (length