#include <iostream>
#include <fstream>

using namespace std;

int main()
{
ifstream in("radixsort.in");
ofstream out("radixsort.out");
int n,a,b,c,i,aux,l,m;

in>>n>>a>>b>>c;
long long v[n+1];

v[1]=b;
for (i=2; i<=n; i++)
  v[i]=(a*v[i-1]+b)%c;

for (l=1; l<=n; l++)
  {
  m=l;
  while (m>1 && v[m-1]>v[m])
    {
    aux=v[m];
    v[m]=v[m-1];
    v[m-1]=aux;
    m--;
    }
  }

for (i=1; i<=n; i=i+10)
  out<<v[i]<<' ';
}