#include<iostream>
#include<fstream>

using namespace std;


class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char *nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser &operator>>(int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser &operator>>(long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

InParser in("radixsort.in");
ofstream out("radixsort.out");


const int radix_size = 8;
const int mask = 0xff;
const int byte_count = (1 << radix_size) + 10;

const int num_bytes = sizeof(int);
const int mx = 10000100;


int n, a, b, c;
int v[mx], temp[mx];

int get_byte(int number, int byte) {
    return (number >> (byte * 8)) & mask;
}

void counting_sort(int *x, int *y, int byte) {
    int freq[byte_count];
    int index[byte_count];

    for (int i = 0; i < byte_count; i++) {
        freq[i] = 0;
        index[i] = 0;
    }

    for (int i = 0; i < n; i++) {
        freq[get_byte(x[i], byte)]++;
    }

    index[0] = 0;
    for (int i = 1; i < byte_count; i++) {
        index[i] = index[i - 1] + freq[i - 1];
    }

    for (int i = 0; i < n; i++) {
        int where = index[get_byte(x[i], byte)]++;
        y[where] = x[i];
    }
}

int main() {
    in >> 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;
    }
    for (int i = 0; i < num_bytes; i++) {
        if (i % 2 == 0) {
            counting_sort(v, temp, i);
        } else {
            counting_sort(temp, v, i);
        }
    }
    for (int i = 0; i < n; i += 10) {
        out << v[i] << " ";
    }

    return 0;
}