#include <fstream>
#include <algorithm>
#define MAX 1000000

using namespace std;

ifstream fin  ("radixsort.in");
ofstream fout ("radixsort.out");

void read ();
void solve ();
void print ();

unsigned int N, A, B, C;

unsigned int v[MAX];
unsigned int aux;
unsigned int i;

int main ()
{
    read ();
    solve ();
    print ();
    return 0;
}

void read ()
{
    fin >> N >> A >> B >> C;
}

void solve ()
{
    v[1] = B % C;
    for (i=2; i<=N; i++)
        v[i] = (1LL*A*v[i-1]%C+B) % C;
    sort (v, v+N);
}

void print ()
{
    for (i=1; i<=N; i+=10)
        fout << v[i] << " ";
}