Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

You are given $n$ packages of $w_i$ kg from a belt conveyor in order ($i = 0, 1, ... n-1$). You should load all packages onto $k$ trucks which have the common maximum load $P$. Each truck can load consecutive packages (more than or equals to zero) from the belt conveyor unless the total weights of the packages in the sequence does not exceed the maximum load $P$.

Write a program which reads $n$, $k$ and $w_i$, and reports the minimum value of the maximum load $P$ to load all packages from the belt conveyor.

Input

In the first line, two integers $n$ and $k$ are given separated by a space character. In the following $n$ lines, $w_i$ are given respectively.

Output

Print the minimum value of $P$ in a line.

Constraints

$1 \leq n \leq 100,000$

$1 \leq k \leq 100,000$

$1 \leq w_i \leq 10,000$

Sample Input 1

5 3
8
1
7
3
9

Sample Output 1

10

If the first truck loads two packages of $\{8, 1\}$, the second truck loads two packages of $\{7, 3\}$ and the third truck loads a package of $\{9\}$, then the minimum value of the maximum load $P$ shall be 10.

Sample Input 2

4 2
1
2
2
6

Sample Output 2

6

If the first truck loads three packages of $\{1, 2, 2\}$ and the second truck loads a package of $\{6\}$, then the minimum value of the maximum load $P$ shall be 6.

Solution in Ruby (judge verdict: Wrong Answer)

$truck_number = 0
class Truck
  def initialize
    @weight = 0
    $truck_number += 1
  end
  attr_accessor :max_weight, :truck_number

  def put(weight)
    @weight += weight
  end
end

n, k = gets.split(' ').map(&:to_i)
packages = []
sum = 0
n.times do
  packages << gets.to_i
end
average_weight_per_truck = (packages.sum / k)..(packages.sum / k) + 2
truck = Truck.new
min_max_weight = 0
packages.each do |value|
  sum += value
  if average_weight_per_truck === sum
    min_max_weight = sum if min_max_weight < sum
    truck = Truck.new
    sum = 0
  end
  break if $truck_number > k
  truck.put value
end

puts min_max_weight