#include<bits/stdc++.h>
using namespace std;
long long n,m[20100],a,b,p[20100],o[20100],u,ma;
int bfs(long long i,long long j,long long k){
    if(i>n){
        if(j>ma){
            ma=j;
            u=k;
            o[k]=-1;
            return 1;
        }
        return 0; 
    }
    int w;
    for(int x=a;x<=b;x++){
        w=bfs(i+x,j+m[x+i],k+1);
        if(w){
            o[k]=i;
        }
    }
    return w;
}
int main(){
    freopen("iceroad.in","r",stdin);
    freopen("iceroad.out","w",stdout);
    cin>>n>>a>>b;
    for(int x=0;x<=n;x++){
        cin>>m[x];
    }
    bfs(0,0,0);
    for(int x=0;x<=u;x++){
        cout<<o[x]<<" ";
    }
    return 0;
}