Maximize Consecutive Revenue

You are given an array of integers `revenue` representing daily revenues of a business over a period. Your task is to find the maximum total revenue you can obtain from any contiguous subarray of daily revenues, considering at most `k` days with negative revenue can be included in your subarray. Return this maximum total revenue. Input Format: - The first line contains an integer `n`, the number of elements in the `revenue` array. - The second line contains an integer `k`, the maximum number of negative revenues allowed in the subarray. - The third line contains `n` integers, the daily revenues. Output Format: - Output the maximum total revenue as an integer. Example: Input: 6 2 1 -2 3 4 -1 2 Output: 10