#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 p, int q, int r){

	vector<vector<vector<vector<int>>>> dp(
        n + 1, vector<vector<vector<int>>>(
            p + 1, vector<vector<int>>(
                q + 1, vector<int>(r + 1, INF)
            )
        )
    );
	
	dp[0][0][0][0] = 0;
	
	for(int i=1; i<=n; i++){
		for(int j=0; j<=p; j++){
			for(int k=0; k<=q; k++){
				for(int l=0; l<=r; l++){
					if(dp[i-1][j][k][l] != INF)
						dp[i][j][k][l] = dp[i-1][j][k][l];
						
					if(j-1>=0){
						if(dp[i-1][j-1][k][1] != INF)
							dp[i][j][k][l] = min(dp[i][j][k][l], dp[i-1][j-1][k][l] + a[i-1]);
					}
					if(i-2>=0 && k-1>=0){
						if(dp[i-2][j][k-1][1] != INF)
							dp[i][j][k][l] = min(dp[i][j][k][l], dp[i-2][j][k-1][l] + a[i-1] + a[i-2]);
					}
					if(i-3>=0 && l-1>=0){
						if(dp[i-3][j][k][1-1] != INF)
							dp[i][j][k][l] = min(dp[i][j][k][l], dp[i-3][j][k][l-1] + a[i-1] + a[i-2] + a[i-3]);
					}
				}
			}
		}
	}
	
	int sum = 0;
	for(int i=0; i<n; i++) sum += a[i];
	
	return sum - dp[n][p][q][r];
}




int consistency2(int n, int p, int q, int r){

	vector<vector<vector<vector<int>>>> dp(
        n + 1, vector<vector<vector<int>>>(
            p + 1, vector<vector<int>>(
                q + 1, vector<int>(r + 1, -INF)
            )
        )
    );
	
	dp[0][0][0][0] = 0;
	
	for(int i=1; i<=n; i++){
		for(int j=0; j<=p; j++){
			for(int k=0; k<=q; k++){
				for(int l=0; l<=r; l++){
					
					if(dp[i-1][j][k][l] != -INF)
						dp[i][j][k][l] = dp[i-1][j][k][l] + a[i-1];
					
					if(j-1>=0){
						if(dp[i-1][j-1][k][l] != -INF)
							dp[i][j][k][l] = max(dp[i][j][k][l], dp[i-1][j-1][k][l]);
					}
					if(i-2>=0 && k-1>=0){
						if(dp[i-2][j][k-1][l] != -INF)
							dp[i][j][k][l] = max(dp[i][j][k][l], dp[i-2][j][k-1][l]);
					}
					if(i-3>=0 && l-1>=0){
						if(dp[i-3][j][k][l-1] != -INF)
							dp[i][j][k][l] = max(dp[i][j][k][l], dp[i-3][j][k][l-1]);
					}
				}
			}
		}
	}
	
	return dp[n][p][q][r];
}












int practice(int n, int p, int q, int r){


    return 0;
}





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