#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<algorithm>

#include<cctype>

#include<cmath>

#include<cstdlib>

#include<queue>

#include<ctime>

#include<vector>

#include<set>

#include<map>

#include<stack>

using namespace std;

#define li long long

#define pb push_back

#define mp make_pair

#define y1 y12345678909

#define rii register int

#define pii pair<int,int>

#define r(x) scanf("%d",&x)

#define ck(x) cout<<x<<endl;

#define uli unsigned long long

#define sp cout<<"---------------------------------------------------"<<endl

struct node {

      int d,no;

}a[];

int ans[];

inline bool cmp (const node x,const node y){

      return x.d<y.d;

}

int main(){

      freopen("input.txt","r",stdin);

      freopen("output.txt","w",stdout);

      int n,m,i,z,y,all,x;

      r(n),r(m),r(y);

      all=m;

      for(i=;i<=n;i++){

          r(x);

        z=x*m;

        ans[i]+=z/y;

        all-=ans[i];

        z%=y;

        a[i].d=z;

        a[i].no=i;

      }

      sort(a+,a+n+,cmp);

      for(i=n-all+;i<=n;i++)

        ans[a[i].no]++;

      for(i=;i<=n;i++)

        printf("%d ",ans[i]);

      puts("");

      return ;

}