#include<bits/stdc++.h>

#define ll long long

#define maxn 100005

using namespace std;

int a[maxn],n,K;

ll l,r,mid,le,ri;

inline int calc(){

	int ans=0;

	ll now=0;

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

		now+=(ll)a[i];

		if(now<0) now=0;

		else if(now>=mid) now=0,ans++;

	}

	return ans;

} 

int main(){

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

	for(int i=1;i<=n;i++) scanf("%d",a+i);

	le=1ll<<62,ri=-(1ll<<62);

	l=1,r=n*(ll)(1ll<<30);

	while(l<=r){

		mid=l+r>>1;

		if(calc()>=K) ri=mid,l=mid+1;

		else r=mid-1;

	}

	l=1,r=n*(ll)(1ll<<30);

	while(l<=r){

		mid=l+r>>1;

		if(calc()<=K) le=mid,r=mid-1;

		else l=mid+1;

	}

	if(le<=ri) printf("%lld %lld\n",le,ri);

	else puts("-1");

	return 0;

}