#include <iostream>
#include <fstream>
#define NMAX 10000001
#define RADIX 0xFF
#define RADIX_SIZE 8
#define get_byte(x) ((x >> (byte * 8)) & RADIX)
#define TOTAL_BYTES 4

using namespace std;

ifstream in("radixsort.in");
ofstream out("radixsort.out");
int a[NMAX], n, A, B, C;

void CountSort(int A[], int B[], int byte)
{
    int _count[1<<RADIX_SIZE];
    int index[1<<RADIX_SIZE ];
    int length = (1 << RADIX_SIZE) - 1;
    for (int i = 0; i <= length; i++)
        _count[i] = 0;
    for (int i = 1; i <= n; i++)
        _count[get_byte(A[i])]++;
    index[0] = 1;
    for (int i = 1; i <= length; i++)
        index[i] = index[i - 1] + _count[i - 1];
    for (int i = 1; i <= n; i++)
        B[index[get_byte(A[i])]++] = A[i];
}

void RadixSort(int A[], int n)
{
    int *B = new int[n + 1];
    for (int i = 0; i < TOTAL_BYTES; i++)
        if (i % 2 == 0)
            CountSort(A,B,i);
        else
            CountSort(B,A,i);
    delete[] B;
}

int main()
{
    in >> n >> A >> B >> C;
    in.close();
    a[1] = B % C;
    for (int i = 2; i <= n; i++)
        a[i] = (A * 1LL * a[i-1] %C + B) % C;
    RadixSort(a,n);
    for (int i = 1; i <= n; i += 10)
        out << a[i] << " ";
    out << "\n";
    out.close();
    return 0;
}