#include<cstdio>

#include<iostream>

#include<cstring>

#include<cstdlib>

#include<algorithm>

#include<cmath>

using namespace std;

typedef long long LL;

int n,m;LL a[];

int check(LL mid)

{

    LL sum=,ss=;

    for(int i=;i<=n;i++)

    {

        sum+=a[i];

        if(sum>=mid){sum=;ss++;}

        if(sum<)sum=;

    }

    if(ss==m)return ;

    if(ss<m)return ;

    else return ;

}

int main()

{

    scanf("%d%d",&n,&m);

    for(int i=;i<=n;i++)scanf("%lld",&a[i]);

    LL l,r;

    LL mmin=-;

    l=,r=100000LL*1000000000LL;

    while(l<=r)

    {

        LL mid=(l+r)/;

        int d=check(mid);

              if(d==)r=mid-;

        else if(d==)l=mid+;

        else

        {

            r=mid-;

            mmin=mid;

        }

    }

    LL mmax=-;

    l=,r=100000LL*1000000000LL;

    while(l<=r)

    {

        LL mid=(l+r)/;

        int d=check(mid);

             if(d==)r=mid-;

        else if(d==)l=mid+;

        else

        {

            l=mid+;

            mmax=mid;

        }

    }

    if(mmin==-)printf("-1\n");

    else printf("%lld %lld\n",mmin,mmax);

    return ;

}