#include <fstream>
#include <string.h>

#define get_byte(x) ((x >> (byte*8))&radix)
#define radix 0xFF
#define radix_size 8
#define nMax 100000001
using namespace std;
ifstream fin("radix.in");
ofstream fout("radix.out");
int n;
int v[nMax], temp[nMax];
void read()
{
    int a, b, c;
    fin>>n>>a>>b>>c;

    v[0]=b%c;
    for(int i=1;i<n;i++)
        v[i]=(1LL*a*v[i-1]%c+b)%c;
}
void counting_sort(int A[], int B[], int byte)
{
    int index[1 << radix_size];
    int counter[1 << radix_size];

    memset(counter, 0, sizeof(counter));

    for(int i=0;i<n;i++)
        counter[get_byte(A[i])]++;

    index[0]=0;
    for(int i=1;i<(1 << radix_size);i++)
        index[i]=index[i-1]+counter[i-1];

    for(int i=0;i<n;i++)
        B[index[get_byte(A[i])]++]=A[i];
}
void write()
{
    for(int i=0;i<n;i+=10)
        fout<<v[i]<<" ";
}
void solve()
{
    for(int i=0;i<4;i++)
    {
        if(i%2==0)
            counting_sort(v, temp, i);
        else
            counting_sort(temp, v, i);
    }
}
int main()
{
    read();
    solve();
    write();
    return 0;
}