#include <fstream>
#include <vector>
using namespace std;

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

int a[10000001], maxNumber;
vector <int> bucket[1000];

void radixSort (int n) {
    int i, nr, r, k, j, l, buckCount[1000], divisor = 1;

    for (i = 0; i < 1000; i++) {
        bucket[i].resize(1000);
    }

    //aflam cate grupuri de 3 cifre are cel mai mare numar gasit:
    nr = 0;
    while (maxNumber != 0) {
        nr++;
        maxNumber /= 1000;
    }

    for (j = 0; j < nr; j++) {
        for (k = 0; k < 1000; k++) {
            buckCount[k] = 0;
        }
        //Initialize bucket count;
        for (i = 0; i < n; i++) {
            r = (a[i] / divisor) % 1000;
            if(buckCount[r] >= bucket[r].size()) {
                bucket[r].push_back(a[i]);
            }
            else {
                bucket[r][buckCount[r]] = a[i];
            }
            buckCount[r]++;
        }

        // colectam elementele din bucket
        for (k = 0, i = 0; k < 1000; k++) {
            for (l = 0; l < buckCount[k]; l++)
                a[i++] = bucket[k][l];
        }
        divisor *= 1000;
    }
}

int main() {
    int N, i;
    long long A, B, C;
    fin >> N >> A >> B >> C;

    maxNumber = a[0] = B;
    for (i = 1; i < N; i++) {
        a[i] = (int) ((A * a[i - 1] + B) % C);
        //gasim numarul maxim in lista data:
        maxNumber = a[i] > maxNumber ? a[i] : maxNumber;
    }

    radixSort(N);

    for (i = 0; i < N; i += 10) {
        fout << a[i] << " ";
    }

    return 0;
}