give integer array num integer k find nonoverlapping subarray length k maximum sum return themreturn result list index represent start position interval 0indexed if multiple answer return lexicographically smallest Example 1input num 12126751 k 2output 035Explanation Subarrays 1 2 2 6 7 5 correspond start index 0 3 5we take 2 1 answer 1 3 5 lexicographically largerexample 2input num 121212121 k 2output 024 Constraints1 numslength 2 1041 numsi 2161 k floornumslength 3