You are given n positive workloads in a fixed order and m workers.

Split the array into exactly m non-empty contiguous groups. A worker receives one group, and that worker's load is the sum of its group.

Minimize the maximum load assigned to any worker.

The first line contains KaTeX can only parse string typed expression and KaTeX can only parse string typed expression.
The second line contains KaTeX can only parse string typed expression positive integers.

Print the minimum possible value of the maximum group sum.