Problem Statement

A teacher has N number of books. Every ith book has A i number of pages. He has to allocate contiguous books to M number of students. There can be many ways or permutations to do so. In each permutation, one of the M students will be allocated the maximum number of pages. Out of all these permutations, the task is to find that particular permutation in which the maximum number of pages allocated to a student is the minimum of those in all the other permutations and print this minimum value . Each book will be allocated to exactly one student. Each student has to be allocated at least one book. Note : Return -1 if a valid assignment is not possible, and allotment should be in contiguous order (see the explanation for better understanding). Input Format – The first line of input contains two integers N, and M . The second line contains N space-separated integers. Output Format – Print the maximum number of pages allocated to a student which is the minimum of those in all the other permut