#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 m){
	
	vector<int> dp(n+1, -INF);
	dp[0] = 0;
	
	for(int i=m; i<=n; i++){
		
		int sum = 0;
		int j = i;
		while(j>=i-m+1){
			sum += a[j-1];
			j--;
		}
		
		while(j>=0){
			dp[i] = max(dp[i] , dp[j] + sum );
			j--;
		}
	}
	
	int maxi = -INF;
	for(int i=1; i<=n; i++){
		maxi = max(maxi, dp[i]);
	}
	
	return maxi;
}







int consistency2(int n, int m){
	
	vector<int> dp(n+1, -INF);
	vector<int> pMaxi(n+1, 0);
	dp[0] = 0;
	
	int sum = 0;
	for(int i=1, j=1; i<=n; i++){
		sum += a[i-1];

		if(i-j == m){
			sum -= a[j-1];
			j++;
		}		
		
		if(i-j+1 == m){
			dp[i] = pMaxi[j-1] + sum;
			pMaxi[i] = max(pMaxi[i-1], dp[i]);
		}
	}
	
	
	return pMaxi[n];
}




//? Approach 2 : 

int consistency3(int n, int m){
	
	vector<int> dp(n);
	
	int sum = 0;
	for(int i=0, j=0; i<n; i++){
		sum += a[i];

		if(i-j == m){
			sum -= a[j];
			j++;
		}		
		
		if(i-j+1 == m){
			dp[i] = dp[i-1];
			if(j-1>=0) dp[i] = max(dp[i], dp[j-1]+sum);
			else  dp[i] = max(dp[i], sum);
		}
	}
	
	
	return dp[n-1];
}











int practice(int n, int m){


    return 0;
}





void solve() {
    
    int n, m;
    cin>> n >> m;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    cout << consistency1(n, m) << " " << consistency2(n, m) << " " << consistency3(n, m) << 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;
}