#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int v[10000001];
queue <int> q[257];
long long kmax,n,a,b,c,k,aux,i,j,calc,e;
int main()
{
    f>>n>>a>>b>>c;
    v[1]=b;
    for(i=2;i<=n;i++)
        v[i]=((v[i-1]*a)%c+b)%c;
    for(i=0;i<=24;i+=8)
    {
        for(j=1;j<=n;j++)
           q[(v[j]>>i)&255].push(v[j]);
        e=0;
        for(j=0;j<=255&&e<n;j++)
            while(!q[j].empty())
            {
                v[++e]=q[j].front();
                q[j].pop();
            }

    }
    for(i=1;i<=n;i+=10)
        g<<v[i]<<" ";
    return 0;
}