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

ifstream f("radixsort.in");
ofstream g("radixsort.out");
long long v[10000002];
int output[10000002];

void radixsort(long long v[], int n)
{
    int count[256];
    for(int i=0;i<32;i+=8)
    {
        for(int j=0;j<256;j++)
            count[j] = 0;
        for(int j=0;j<n;j++)
            count[(v[j]>>i)& 255] ++;
        for(int j=1;j<256;j++)
            count[j] += count[j-1];
        for(int j=n-1;j>=0;j--)
        {
            count[(v[j] >> i) & 255] --;

            output[count[(v[j] >> i) & 255]] = 1LL * v[j];

            if(output[count[(v[j] >> i) & 255]] < 0)
                cout << "ALO";
        }
        for(int j=0;j<n;j++)
            v[j] = output[j];
    }
}

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(v,N+1);
    for(int i=1;i<=N;i+=10)
        g << v[i] << " ";

}