#include <iostream>
#include <fstream>
using namespace std;

ifstream f("radixsort.in");
ofstream g("radixsort.out");
long long v[10000002];
void radixsort(long long v[], int n)
{

}

int main()
{
    int N,A,B,C;
    f>>N >> A >> B >> C;
    v[1] = B;
    for(int i=2;i<=N;++i)
        v[i] = (A*v[i-1]+B)%C;


    // radixsort inline function
    //

    int output[10000002];
    int count[256];
    int i,j;
    for(i=0;i<32;i+=8)
    {
        for(j=0;j<256;++j)
            count[j] = 0;
        for(j=0;j<N;++j)
            count[(v[j]>>i)& 255] ++;
        for(j=1;j<256;++j)
            count[j] += count[j-1];
        for(j=N-1;j>=0;--j)
        {
            count[(v[j] >> i) & 255] --;
            output[count[(v[j] >> i) & 255]] = 1LL * v[j];
        }
        for(j=0;j<N;++j)
            v[j] = output[j];
    }

    //
        for(int i=1;i<=N;i+=10)
        g << v[i] << " ";

}