#include <stdio.h>
#define NMAX 10000005

using namespace std;

FILE* fin, * fout;
unsigned int n, v[NMAX];
unsigned int tmp[NMAX];

unsigned int getMaxNoOfDigits() {
    unsigned int max = v[1];
    for (unsigned int i = 2;i <= n;++i)
        if (v[i] > max) max = v[i];
    unsigned int nr = 0;
    do {
        ++nr;
        max /= 10;
    } while (max);

    return nr;
}

void sortByDigit(unsigned int p) {
    unsigned int count[10] = { 0 };
    for (unsigned int i = 1;i <= n;++i) {
        unsigned int digit = (v[i] / p) % 10;
        ++count[digit];
    }
    for (unsigned int i = 1;i <= 9;++i)
        count[i] += count[i - 1];
    for (unsigned int i = n;i > 0;--i) {
        unsigned int digit = (v[i] / p) % 10;
        tmp[count[digit]--] = v[i];
    }
    for (unsigned int i = 1;i <= n;++i)
        v[i] = tmp[i];
}

void radixSort() {
    unsigned int p = 1;
    unsigned int m = getMaxNoOfDigits();
    for (unsigned int i = 1;i <= m;++i) {
        sortByDigit(p);
        p *= 10;
    }
}

int main()
{
    fin = fopen("radixsort.in", "r");
    fout = fopen("radixsort.out", "w");

    unsigned int a, b, c;
    fscanf(fin, "%i %i %i %i", &n, &a, &b, &c);
    v[1] = b;
    for (unsigned int i = 2;i <= n;++i) {
        v[i] = (a * v[i - 1] + b) % c;
    }
    radixSort();
    for (unsigned int i = 1;i <= n;i+=10)
        fprintf(fout,"%i ", v[i]);

  
    return 0;
}