# include <bits/stdc++.h>
using namespace std;
const clock_t begin_time = clock();
 float Time = 1.0;

mt19937 rand_Gen(758965475);

long long N,M,A,B;
const long long maxn = 100005;
long long p[maxn];
bool gett[maxn];
bool had[maxn];
long long ANS=1e18;
vector <long long> maxans;
vector <long long> curr;
struct task
{
    long long id,p;
};
vector <task> z;
long long MIN(long long A, long long B)
{
    if(A<B)return A;
    return B;
}
bool cmp(task i, task j)
{
    //long long ans1 = i.id*A + i.p*B;
    //long long ans2 = j.id*A + j.p*B;
    //return ans1<ans2;
    return i.p<j.p;
}
long long calcdist(int a, int b)
{
   // cout<<a<<" & "<<b<<endl;;
    long long ans;
    if(b>N)return 0;
    if(a<=0)
    {
        ans= ((b-1)*B + p[b]*A);
    }
    else
    ans= (abs(b-a)*B + abs(p[a]-p[b])*A);
   // cout<<a<<" "<<b<<" "<<ans<<endl;
    return ans;
  //  cout<<" * "<<ans<<endl;
}
void divsort(int from, int to)
{
    //cout<<from<<" "<<to<<endl;
    if(from==to)return ;
    int mid = (from+to)/2;
    divsort(from,mid);
    divsort(mid+1,to);
    //cout<<from<<" "<<to<<endl;
    vector <task> q;
    int i=from,j=mid+1;
    task y;
    y.id = 0;
    y.p = 0;
    deque <task> l,r;
    for(i=from;i<=mid;i++)
        l.push_back(z[i]);
    for(i=mid+1;i<=to;i++)
        r.push_back(z[i]);
    q.push_back(y);
     while(!l.empty()||!r.empty())
    {
      //  cout<<i<<" "<<mid<<" "<<j<<" "<<to<<endl;
      task best;
        if(l.empty())
        {
            best = r.front();
            if(calcdist(q.back().id,best.id)>calcdist(q.back().id,r.back().id))
            {
                q.push_back(r.back());
                r.pop_back();
            }
            else
            {
                q.push_back(r.front());
                r.pop_front();
            }

           // j++;
            continue;
        }
        if(r.empty())
        {
            task  best = l.front();
            if(calcdist(q.back().id,best.id)>calcdist(q.back().id,l.back().id))
            {
                q.push_back(l.back());
                l.pop_back();
            }
            else
            {
                q.push_back(l.front());
                l.pop_front();
            }
            continue;
        }
        long long ans1 = MIN(calcdist(q.back().id,l.front().id),calcdist(q.back().id,l.back().id));
        long long ans2 = MIN(calcdist(q.back().id,r.front().id),calcdist(q.back().id,r.back().id));
        if(ans1<ans2)
        {
           // cout<<"HERE"<<endl;
            task  best = l.front();
            if(calcdist(q.back().id,best.id)>calcdist(q.back().id,l.back().id))
            {
                q.push_back(l.back());
                l.pop_back();
            }
            else
            {
                q.push_back(l.front());
                l.pop_front();
            }
            continue;
        }else
        {
           // cout<<"H"<<endl;
             best = r.front();
            if(calcdist(q.back().id,best.id)>calcdist(q.back().id,r.back().id))
            {
                q.push_back(r.back());
                r.pop_back();
            }
            else
            {
                q.push_back(r.front());
                r.pop_front();
            }

           // j++;
            continue;
        }

    }
   /* while(i<=mid||j<=to)
    {
      //  cout<<i<<" "<<mid<<" "<<j<<" "<<to<<endl;
        if(i>mid)
        {
            q.push_back(z[j]);
            j++;
            continue;
        }
        if(j>to)
        {
            q.push_back(z[i]);
            i++;
            continue;
        }
        if(calcdist(q.back().id,z[i].id)<calcdist(q.back().id,z[j].id))
        {
//cout<<"HERE"<<endl;
             q.push_back(z[i]);
            i++;
            continue;
        }
        else
        {
            //cout<<"H"<<endl;
             q.push_back(z[j]);
            j++;
            continue;
        }
    }*/   // cout<<"OKAY"<<endl;
    for(i=1;i<q.size();i++)
        z[i+from-1]=q[i];

    return ;
}
bool lefttime()
{
    return ( float( clock () - begin_time ) /  CLOCKS_PER_SEC<Time);
}
long long calc_diff(long long u, long long v)
{
    long long ans = (v-u)*B;
    if(ans<0)ans=  -ans;
    if(u==0)ans-=B;
    long long k =  p[v]-p[u];
    if(k<0)k = -k;
    ans = ans + k*A;
    return ans;
}
void compare(long long ans)
{
    if(ans>=ANS)return ;
    ANS = ans;
    maxans = curr;

}
void print()
{
    //cout<<ANS<<endl;
    for(long long i=1; i<maxans.size(); i++)
        cout<<maxans[i]<<" ";
    cout<<endl;
}
vector <pair <long long, long long> > K;
void create_massive(long long v)
{
    K.clear();
    long long i;
    for(i=1; i<=N; i++)
    {
        if(gett[i])continue;
        K.push_back({calc_diff(v,i),i});
    }
    sort(K.begin(),K.end());
}
void solve(long long solved, long long v, long long ans)
{
    if(!lefttime())
    {
        //print();
        //exit(0);
        return  ;
    }
    gett[v]  = 1;
    curr.push_back(v);
    if(solved==M)
    {
        compare(ans);
        return ;
    }
    if(N<=0)
    {
        vector <pair <long long, long long> > k;
        long long i;

        for(i=1; i<=N; i++)
        {
            if(gett[i])continue;
            k.push_back({calc_diff(v,i),i});
        }
        sort(k.begin(),k.end());
        for(i=0; lefttime()&&i<k.size(); i++)
        {
            solve(solved+1,k[i].second,ans+k[i].first);
        }
    }
    else
    {
        long long curr = 0;
        long long i; create_massive(v);
        for(i=0; lefttime()&&i<K.size(); i++)
        {


            solve(solved+1,K[i].second,ans+K[i].first);
            create_massive(v);
            curr++;
        }
    }

    gett[v] = 0;
    curr.pop_back();
    return ;
}
bool had2[maxn];
bool NEED = true;
void checkforbetter(int a)
{
    if(had[a])return ;
    had[a] = 1;
    if(gett[a])return ;
    int i;
    for(i=0;i<M;i++)
    {
        if((calcdist((i-1<0 ? 0 : curr[i-1]),curr[i])+calcdist(curr[i],((i+1)<M ? curr[i+1] : N+1)))>calcdist((i-1<0 ? 0 : curr[i-1]),a)+calcdist(a,((i+1)<M ? curr[i+1] : N+1)))
        {
            gett[curr[i]] = 0;
            gett[a] = 1;
            curr[i]=  a;

            return ;
        }
    }

}
void searchforbetter(int x)
{
    if(had2[x])return ;
    had2[x] = 1;
    long long ans = calcdist((x-1<0 ? 0 : curr[x-1]),curr[x])+calcdist(curr[x],((x+1)<M ? curr[x+1] : N+1));
    int i;
    int best = curr[x];
    long long t ;
    for(i=1;i<=N;i++)
    {
        if(gett[i])continue;
        t = calcdist((x-1<0 ? 0 : curr[x-1]),i)+calcdist(i,((x+1)<M ? curr[x+1] : N+1));
        if(t<ans)
        {
            ans = t;
            best = i;
        }
    }//cout<<best<<" "<<ans<<endl;
    gett[curr[x]] = 0;
    gett[best]  = 1;
    curr[x] = best;
}
void resort()
{
    if(!NEED)return ;
    NEED = 0;
    for(int i=0;i<M-1;i++)
    {
        long long ans1 = calcdist((i==0 ? 0 : curr[i-1]) , curr[i])+calcdist(curr[i+1],(i+2>=M ? N+1 : curr[i+2]));
        long long ans2 = calcdist((i==0 ? 0 : curr[i-1]),curr[i+1])+calcdist(curr[i],(i+2>=M ? N+1: curr[i+2]));
        if(ans2<ans1)
        {
            NEED = 1;
            swap(curr[i],curr[i+1]);
        }

    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
 freopen ("cheating.out","w",stdout);
    freopen ("cheating.in","r",stdin);
    cin>>N>>M>>A>>B;
    long long i,j;
    for(i=1; i<=N; i++)
        cin>>p[i];
       if(N>2000)
        {
            for(i=1;i<=N;i++)
            {
                task S;
                S.id =i;
                S.p = p[i];
                z.push_back(S);
            }
            sort(z.begin(),z.end(),cmp);
          divsort(0,z.size()-1);
            long long bestans, firstt,current = calcdist(0,z[0].id);
            for(i=0;i<M-1;i++)
            {
                current = current + calcdist(z[i].id,z[i+1].id);
            }
            bestans = current;
            firstt = 0;
            for(i=M;i<z.size();i++)
            {
                current = current + calcdist(z[i-1].id,z[i].id)  - calcdist(z[i-M].id,z[i-M+1].id) - calcdist(0,z[i-M].id) + calcdist(0,z[i-M+1].id);
                if(current<bestans)
                {
                    bestans = current;
                    firstt = i-M+1;
                }
            }
            //for(i=0;i<M;i++)
              //  cout<<z[i+firstt].id<<" ";
           // cout<<endl;
           // return 0;
            curr.resize(M);

            for(i=0;i<M;i++)
            {
                int x = z[i+firstt].id;
                if(gett[x]){i--;continue;}
                curr[i] = x;
                gett[x] = 1;
            }
            resort();
            int iteration = 0;
            Time = 4.6;
            while(lefttime())
            {

                int x = rand_Gen()%M;
               // cout<<x<<endl;
                searchforbetter(x);
                x=  rand_Gen()%N+1;
                checkforbetter(x);
                resort();
            }
            NEED = 1;
            resort();
           /* long long sum = 0;
            for(i=0;i<curr.size();i++)
        {
            sum = sum + calcdist((i==0 ? 0 : curr[i-1]),curr[i]);
            cout<<sum<<endl;
        }
        cout<<sum<<endl;
            cout<<bestans<<endl;*/
                for(j=0;j<curr.size();j++)
                cout<<curr[j]<<" ";
            cout<<endl;
            return 0;
        }
       // return 0;/// /////////////////////////////////////////////////////////////////////// remove
    solve(0,0,0);
    long long sum = 0;
    curr.clear();
    for(i=1;i<maxans.size();i++)
    {
        curr.push_back(maxans[i]);
    }
    memset(gett,0,sizeof(gett));
    for(i=0;i<curr.size();i++)
    {
        gett[curr[i]] = 1;
    }
    Time = 4.6;
     resort();
            int iteration = 0;
            while(lefttime())
            {

                int x = rand_Gen()%M;
               // cout<<x<<endl;
                searchforbetter(x);
                x=  rand_Gen()%N+1;
                checkforbetter(x);
                resort();
            }
            NEED = 1;
            resort();
    for(i=0;i<curr.size();i++)
        cout<<curr[i]<<" ";
    cout<<endl;
  //  print();*/
    return 0;