#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) ((x).begin()), ((x).end())
typedef long long LL;
const int N = 10001;
const int L = 101;
int a[N];
LL s[N];
LL dp[L][L][L];
unsigned char u[N][L][21];
int pw[5];
inline void renew(int i, int j, int d, LL v, unsigned char x) {
	if(v > dp[i % L][j][d]) {
		dp[i % L][j][d] = v;
		int shift = d % 5;
		int old = u[i][j][d / 5] / pw[shift] % 3;
		
		u[i][j][d / 5] += (x - old) * pw[shift];
	}
}
int main() {
	pw[0] = 1;
	for(int i = 1; i <= 4; i++) {
		pw[i] = pw[i - 1] * 3;	
	}
	int n, k[2], l[2];
	scanf("%d%d%d%d%d", &n, &k[0], &l[0], &k[1], &l[1]);
		
	for(int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		s[i] = s[i - 1] + a[i];
		memset(dp[i % L], -1, sizeof(dp[i % L]));
		for(int j = 0; j <= k[0]; j++) {
			for(int d = 0; d <= k[1]; d++) {
				renew(i, j, d, dp[(i - 1) % L][j][d], 2);
				if(j > 0 && i >= l[0]) {
					renew(i, j, d, dp[(i - l[0]) % L][j - 1][d] + s[i] - s[i - l[0]], 0);
				}
				if(d > 0 && i >= l[1]) {
					renew(i, j, d, dp[(i - l[1]) % L][j][d - 1] + s[i] - s[i - l[1]], 1);
				}
			}
		}
	}
	printf("%lld\n", dp[n % L][k[0]][k[1]]);
	int j = k[0], d = k[1], i = n;
	vector<pair<int, int> > ans;
	while(i > 0) {
		int x = u[i][j][d / 5] / pw[d % 5] % 3;
		if(x == 2) {
			i--;
		}else {
			ans.pb({i - l[x] + 1, i});
			i -= l[x];
			if(x == 0) j--;
			else d--;
		}
	}
	reverse(all(ans));
	for(auto t : ans) printf("%d %d\n", t.fi - 1, t.se);
}