#include<iostream>
#include<algorithm>
#include<cstring>
#include<stack>
#include<bitset>
#include<queue>
#include<vector>
#include<cstdio>
#include<set>
#include<map>
#include<cmath>
#define ll long long
using namespace std;
const ll maxn = 1e5+5;
ll L,K;
ll X[maxn];
ll N;
ll isok() {
	ll ti = 0;
	ll now = 0;
	for(int i=1;i<=L;i++) {
		now += X[i];
		now = max(0ll,now);
		if(now>=N) {
			now = 0;
			ti++;
		}
	}
	return ti;
}
int main(){
	scanf("%lld%lld",&L,&K);
	ll yo = 0; bool fl = 0;
	for(int i=1;i<=L;i++) {
		scanf("%lld",&X[i]);
		if(X[i]>0) fl = 1;
	}
	ll l=1,r=1e18;
	ll ans1=-1,ans2=-1;
	while(l<=r) {
		N = (l+r)>>1;
		ll ans = isok();
		if(ans<=K) {
			r = N-1;
			if(ans==K) ans1=N;
		} else l = N+1;
	}
	l = 1 , r = 1e18;
	while(l<=r) {
		N = (l+r)>>1;
		ll ans = isok();
		if(ans>=K) {
			l = N+1;
			if(ans==K) ans2=N;
		} else r = N-1;
	}
	if(ans1==-1) puts("-1");
	else printf("%lld %lld\n",ans1,ans2);
	return 0;
}