#define nume "radixsort"

#ifndef INFOARENA
#define DBG
#else
#define fisier nume
#endif

#include <algorithm>
#include <cassert>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <vector>
#include <queue>
#ifdef INFOARENA
#include <tr1/unordered_set>
#include <tr1/unordered_map>
using namespace std::tr1;
#else
#include <unordered_set>
#include <unordered_map>
#endif

using namespace std;

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

#define MAX_N 10000000 + 1
#define RADIX 0xFF
#define RADIX_SIZE 8
#define TOTAL_BYTES sizeof(numbers[0])

int n;
int numbers[MAX_N];

#define get_byte(x) ((x>>(byte * 8))&RADIX)

queue<int> counter[1<<RADIX_SIZE];

void countsort(int A[], int B[], int byte) {

    for(int i = 0; i < n; i++)
        counter[get_byte(numbers[i])].push(numbers[i]);
    int c = 0;
    for(int i = 1; i < 1<<RADIX_SIZE; i++) {
        while(!counter[i].empty()) {
            numbers[c++] = counter[i].front();
            counter[i].pop();
        }
    }
}
void radixsort() {
    int *temp = new int[n]; // avem nevoie de un array ca spatiu temporar
    for (int i = 0; i < TOTAL_BYTES; i ++) {
        //if(i % 2 == 0)
        //    countsort(numbers, temp, i);// sortez dupa byte-ul i
        //else
            countsort(temp, numbers, i);
    }
}
void read()
{
    int a,b,c;
    fin>>n>>a>>b>>c;

    numbers[0] = b % c;
    for(int i = 1; i < n; i ++)
        numbers[i] = (1LL * a * numbers[i-1] % c + b) % c;
}

int main()
{
    read();

    radixsort();
//    sort(numbers, numbers + n);

    for(int i = 0; i < n; i +=10)
        fout << numbers[i]<< ' ';
    fout<<endl;

    return 0;
}