#include <iostream>
#include <fstream>
#include <new>
#include <algorithm>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
int d,n,v[16005];
bool verif(int val)
{
    int i,c=0,s;
    for (i=1;i<=n;i++)
    {
        s=0;
        while (s+v[i]<val)
        {
            s=s+v[i];
            i++;
        }
        c++;
    }
    if (c<=d) return 1;
    else return 0;
}
int main()
{
    int i,ma,s=0,mij;
    f>>n>>d;
    for (i=1;i<=n;i++)
        f>>v[i];
    ma=v[1];
    for (i=2;i<=n;i++)
        ma=max(ma,v[i]);
    for (i=1;i<=n;i++) s=s+v[i];
    while (ma!=s)
    {
        mij=(ma+s)/2;
        cout<<ma<<" "<<s<<"\n";
        if(verif(mij)==1) s=mij;
        else ma=mij;
    }
    g<<s+1;
    return 0;
}