#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int v[1000000];
int main ()
{
    int n,a,b,c;
    fin>>n>>a>>b>>c;
    v[1]=b;
    int ct=1;
    int nr=11;
    while (ct<=n)
    {
        ct++;
        v[ct]=(a*v[ct-1]+b)%c;
    }
    sort (v,v+ct);
    for (int i=1;i<ct;i=i+10)
    {
        fout<<v[i]<<" ";
    }
}