#include<iostream>
using namespace std;

const int MAXN=10000;

int p[MAXN+1];

int d[MAXN+1][MAXN+1];
bool v[MAXN+1];

void GetShortestPath(int idx, int n, int m)
{
   v[idx]=true;

   if(m==0)
   {
      return;
   }

   int minD=n;
   for(int i=0; i<n; i++)
   {
      if(!v[i] && (minD==n || d[idx][i]<d[idx][minD]))
      {
         minD=i;
      }
   }

   printf("%d ", minD);
   return GetShortestPath(minD, n, m-1);
}

int main()
{
   freopen("cheating.in","r", stdin);
   freopen("cheating.out","w", stdout);

   int n, m, a, b;
   scanf("%d %d %d %d", &n, &m, &a, &b);

   p[0]=0;
   for(int i=1; i<=n; i++)
   {
      scanf("%d", &p[i]);
   }

   for(int i=0; i<=n; i++)
   {
      v[i]=false;

      for(int j=i+1; j<=n; j++)
      {
         d[i][j]=abs(p[i]-p[j])*a+abs(i-j);
         d[j][i]=d[i][j];
      }
   }

   GetShortestPath(0, n, m);

   printf("\n");

   return 0;
}