#include<stdio.h>
#include<vector>
#include<utility>
#include<algorithm>
std::vector<std::pair<int,int> > X;

const int ran = 10001;
const int step_max = 101;
const int my_step_cnt = 100;
typedef unsigned long long int u64;
typedef __uint128_t u128;
int N, M, K1, K2, L1, L2;
bool ff[step_max];
u64 su[ran];
u64 POOL[101 * 101 * 101];
u128 PATH[101 * 101 * 101];
u64 tmp;u128 tmp2;

int to(int i, int j,int k){
	return (i*(K1+1)+j)*(K2+1)+k;
}
void clear_row(int x){
	for(int i = 0; i <= K1; i++)
	for(int j = 0; j <= K2; j++)
		POOL[to(x, i, j)] = (u64)-1;
}
void upd(int id, u64 tmp, u128 tmp2){
	u64&cur = POOL[id];
	if((!~cur) || cur < tmp){
		cur = tmp;
		PATH[id] = tmp2;
	}
}
int process(){
	for(int i = 0; i < step_max; i++)clear_row(i);
	int x = 0;
	POOL[to(x, 0, 0)] = 0;
	PATH[to(x, 0, 0)] = 0;
	for(int i=0; i<N; i++){
		for(int j1=0; j1<=K1; j1++)for(int j2=0; j2<=K2; j2++){
			int t = to(x, j1, j2);
			tmp = POOL[t];
			tmp2 = PATH[t];
			if(!~tmp)continue;
			upd(to((x+1)%step_max, j1, j2), tmp, tmp2);
			if(j1 + j2 == K1 + K2 - my_step_cnt)tmp += i;
			if(j1 < K1 && i+L1 <= N)
				upd(to((x+L1)%step_max, j1+1, j2), tmp + su[i+L1] - su[i], tmp2 * 2);
			if(j2 < K2 && i+L2 <= N)
				upd(to((x+L2)%step_max, j1, j2+1), tmp + su[i+L2] - su[i], tmp2 * 2 + 1);
		}
		clear_row(x);
		x = (x + 1) % step_max;
	}
	return x;
}

void upd2(int id,u64 tmp){
	u64&cur = POOL[id];
	if((!~cur)||cur<tmp){
		cur = tmp;
	}
}
void gen_res(int lst, int fir){
	for(int i = lst; i >= fir; i--)
		for(int j = 0; j <= M; j++)
			POOL[i*(M+1)+j] = (u64)-1;
	POOL[lst * (M+1)] = 0;
	for(int i = lst; i > fir; i--){
		for(int j=0; j<=M; j++){
			int t = i * (M+1) + j;
			tmp = POOL[t];
			if(!~tmp)continue;
			upd2((i-1) * (M+1) + j, tmp);
			if(j == M)continue;
			int nex = i - (ff[j] ? L2 : L1);
			if(nex >= fir){
				upd2(nex * (M+1) + (j + 1), tmp + su[i] - su[nex]);
			}
		}
	}
	int I = fir, J = M;
	while(J>0){
		tmp = POOL[I * (M+1) + J];
		if(tmp == POOL[(I+1) * (M+1) + J])
			++I;
		else{
			--J;
			int I2 = I + (ff[J] ? L2 : L1);
			X.push_back(std::make_pair(I, I2));
			I = I2;
		}
	}
}

int main() {
	int x;
	scanf("%d%d%d%d%d",&N,&K1,&L1,&K2,&L2);
	if(L1 > L2){
		x = L1;	L1 = L2; L2 = x;
		x = K1; K1 = K2; K2 = x;
	}
	for(int i=1; i<=N; i++){
		scanf("%d",&x);
		su[i] = su[i-1] + (((u64)x) << 16);
	}

	for(bool fir = true;;fir = false){

	int t = to(process(), K1, K2);

	if(fir)printf("%llu\n",POOL[t] >> 16);

	int N2 = POOL[t] & ((1ULL<<16)-1);
	tmp2 = PATH[t];
	M = my_step_cnt;
	if(K1 + K2 < M)M = K1 + K2;
	for(int i=0; i<M; i++){
		ff[i] = bool(tmp2 & 1);
		tmp2 /= 2;
		if(ff[i])K2 --;else
			K1 --;
	}
	gen_res(N, N2);
	if(K1 + K2 > 0)
		N = N2;
	else
		break;

	}

	std::sort(X.begin(),X.end());
	for(auto&Y : X)
		printf("%d %d\n",Y.first,Y.second);
	return 0;
}