#include <iostream>
#include <fstream>
#include <vector>
#define MAX 10000010
#define MOD 256

using namespace std;
typedef long long ll;

ll n,a,b,c;
int v[MAX],v2[MAX],sp[MOD],pa[MOD];
void sorteaza(int sh){
  int sz=0,md,ei;
  for(int i=0;i<MOD;i++)sp[i]=pa[i]=0;
  for(int i=1;i<=n;i++)
    sp[((v[i]>>sh)&(MOD-1))]++;
  for(int i=1;i<MOD;i++)sp[i]+=sp[i-1];
  for(int i=1;i<=n;i++){
    md=((v[i]>>sh)&(MOD-1));
    if(md==0)ei=0; else ei=sp[md-1];
    v2[ei+(++pa[md])]=v[i];
  }
  for(int i=1;i<=n;i++)v[i]=v2[i];
}

int main()
{
    ifstream f ("radixsort.in");
    ofstream g ("radixsort.out");
    f>>n>>a>>b>>c;
    v[1]=b;
    for(int i=2;i<=n;i++)
      v[i]=(a*v[i-1]+b)%c;
    for(int sh=0;sh<31;sh+=8)
      sorteaza(sh);
    for(int i=1;i<=n;i+=10)
      g<<v[i]<<" ";
    f.close ();
    g.close ();
    return 0;
}