#include <fstream>

using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

void sort(int N)
{
    int i,j,aux,v[100001];
    for(i=1;i<N;i++)
     for(j=i+1;j<=N;j++)
      if(v[i]>v[j])
    {
        aux=v[i]; v[i]=v[j]; v[j]=aux;
    }
}
int main()
{
    int N,A,B,C,v[100001],i;
    fin>>N>>A>>B>>C;
    for(i=1;i<=N;i++)
     if(i==1) v[i]=B;
     else
        v[i]=(A*v[i-1]+B)%C;
     sort(N);
     for(i=1;i<=N;i+=10)
        fout<<v[i]<<" ";

    return 0;
}