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

ifstream f("radixsort.in");
ofstream g("radixsort.out");



void radixsort(int v[], int n)
{
    int *output;
    output = new int[n+1];
    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];
    }
}

int main()
{
    int v[10000002];
    long int N,A,B,C;
    f>>N >> A >> B >> C;
    v[1] = B;
    for(int *p = v+2;p<=v+N;++p)
        *p = (A**(p-1)+B)%C;
    radixsort(v,N+1);
    for(int* p=v;p<=v+N;p+=10)
        g << *p << " ";

}