#include <algorithm>
#include <cassert>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <vector>
#include <unordered_set>
#include <unordered_map>
#define NMax 10000001
using namespace std;

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

int n, a, b, c;
int v[NMax];
int counter[256];
int index[256];

void countsort(int A[], int B[], int byte)
{
    memset(counter, 0, sizeof(counter));

    for(int i = 0; i < n; ++i)
        ++counter[(A[i]>>(byte*8)) & 0xFF];

    index[0] = 0;

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

    for(int i = 0; i < n; ++i)
        B[index[(A[i]>>(byte*8)) & 0xFF]++] = A[i];
}

void radixsort()
{
    int *temp = new int [n]; /// array temporar

    for(int i = 0; i < sizeof(v[0]); ++i)
        if(i % 2 == 0) countsort(v, temp, i); /// sortam dupa byte-ul i
        else countsort(temp, v, i);
}

int main()
{
    f >> 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;

    radixsort();

    for(int i = 0; i < n; i += 10)
        g << v[i] << " ";

    return 0;
}