Before the invention of book-printing, it was very hard to make a copy of a book. All the contents had to be re-written by hand by so called scribers. The scriber had been given a book and after several months he finished its copy. One of the most famous scribers lived in the 15th century and his name was Xaverius Endricus Remius Ontius Xendrianus (Xerox). Anyway, the work was very annoying and boring. And the only way to speed it up was to hire more scribers.

Once upon a time, there was a theater ensemble that wanted to play famous Antique Tragedies. The scripts of these plays were divided into many books and actors needed more copies of them, of course. So they hired many scribers to make copies of these books. Imagine you have \(m\) books (numbered \(1,2, \ldots, m\)) that may have different number of pages (\(p_1, p_2, \ldots, p_m\)) and you want to make one copy of each of them.

Your task is to divide these books among \(k\) scribes, \(k \leq m\). Each book can be assigned to a single scriber only, and every scriber must get a continuous sequence of books. That means, there exists an increasing succession of numbers \(0 = b_0 < b_1 < b_2, \ldots, \leq b_k = m\) such that the \(i\)-th scriber gets a sequence of books with numbers between \(b_{i - 1} + 1\) and \(b_i\).

The time needed to make a copy of all the books is determined by the scriber who was assigned the most work. Therefore, our goal is to minimize the maximum number of pages assigned to a single scriber. Your task is to find the optimal assignment.

Input

• One line with two integers \(m\) and \(k\) giving the number of books and the number of scribes.
• \(n\) integers \(p_1, \ldots, p_m\) giving the number of pages in each book.

Output

• One line with the minimum time required to copy the books in an optimal assigment.

Constraints

• \(1 \leq k \leq m \leq 500\)
• \(1 \leq p_i \leq 10000000\)

Be aware of overflows, the sums can get quite large!

Sample Test Cases

Sample input 1

Sample output 1

Sample input 2

Sample output 2