#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;

int consistency1(int n, int x){
	if(n==1) return -INF;
	if(n==1 && x==1) return a[0]-a[1];
	if(n==1) return -INF;

	vector<vector<int>> dp(n+1, vector<int>(x+1, -INF));
	dp[0][0] = 0;
	dp[2][1] = a[0] - a[1];
	
	
	for(int i=3; i<=n; i++){
		
		for(int k=1; k<=x; k++){
			
			int j = i-2;
			while(j>=0){
				dp[i][k] = max(dp[i][k], dp[j][k-1] + ( a[j] - a[i-1]));
				j--;
			}
		}
	}
	
	return dp[n][x];
}



int consistency2(int n, int x){
	if(n==1) return -INF;
	if(n==1 && x==1) return a[0]-a[1];
	if(n==1) return -INF;

	vector<vector<int>> dp(n+1, vector<int>(x+1, -INF));
	dp[0][0] = 0;
	
	
	for(int k=1; k<=x; k++){
		
		int maxSoFar = -INF;
		
		for(int i=2; i<=n; i++){
			
			if(dp[i-2][k-1] != -INF){
				maxSoFar = max(maxSoFar, dp[i-2][k-1] + a[i-2]);
			}
			
			if(maxSoFar != -INF) dp[i][k] = maxSoFar - a[i-1];
		}
	}
	
		
	
	return dp[n][x];
}












int practice(int n, int x){


    return 0;
}





void solve() {
    
    int n, k;
    cin>> n >> k;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency1(n, k) << " " << consistency2(n, k) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}