#include <fstream>
#include <vector>

using namespace std;

const int BIT_COUNT = 8;

vector<int> Values;

void RadixSort(vector<int> &values) {
    int maxBit = 0;
    for (int i = 0; i < int(values.size()); ++i)
        for (; (1 << (BIT_COUNT * maxBit)) <= values[i]; ++maxBit);
    for (int i = maxBit; i >= 0; --i) {
        vector< vector<int> > buckets = vector< vector<int> >(1 << BIT_COUNT, vector<int>());
        for (int j = 0; j < int(values.size()); ++j)
            buckets[(values[j] >> (BIT_COUNT * i)) & ((1 << BIT_COUNT) - 1)].push_back(values[j]);
        for (int b = 0, j = 0; b < (1 << BIT_COUNT); ++b)
            for (vector<int>::const_iterator v = buckets[b].begin(); v != buckets[b].end(); ++v)
                values[j++] = *v;
    }
}

void Read() {
    ifstream cin("radixsort.in");
    int n, a, b, c;
    cin >> n >> a >> b >> c;
    Values = vector<int>(n);
    Values[0] = b;
    for (int i = 1; i < n; ++i)
        Values[i] = (1LL * Values[i - 1] * a + b) % c;
    cin.close();
}

void Print() {
    ofstream cout("radixsort.out");
    for (int i = 0; i < int(Values.size()); i += 10)
        cout << Values[i] << " ";
    cout << "\n";
    cout.close();
}

int main() {
    Read();
    RadixSort(Values);
    Print();
    return 0;
}