#include <iostream>
#include <fstream>
#include <stack>
#include <vector>
#include <deque>
#include <cstring>

#define ll long long
using namespace std;
const int inf = 1e9 + 5;
const int NMax = 1e7 + 5;
const int nrBytes = 4;
const int nrBits = 8;
const int radix = 0b11111111;

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

ll N,A,B,C;
int v1[NMax],v2[NMax];

void radixSort(int*,int*,int);


int main() {
    in>>N>>A>>B>>C;
    v1[1] = B;
    A %= C;
    B %= C;
    for (int i=2;i <= N;++i) {
        v1[i] = (A*v1[i-1] + B) % C;
    }

    for (int b=0;b < nrBytes;++b) {
        if (b & 1) {
            radixSort(v2,v1,b);
        }
        else {
            radixSort(v1,v2,b);
        }
    }

    for (int i=1;i <= N;i += 10) {
        out<<v1[i]<<' ';
    }

    in.close();out.close();
    return 0;
}

void radixSort(int* one,int* two,int byte) {
    int occ[radix + 5] = {};
    for (int i=1;i <= N;++i) {
        ++occ[(one[i]>>(nrBits*byte)) & radix];
    }

    ll total = 0;
    for (int i=0;i <= radix;++i) {
        int old = occ[i];
        occ[i] = total + 1;
        total += old;
    }

    for (int i=1;i <= N;++i) {
        two[occ[(one[i]>>(nrBits*byte)) & radix]++] = one[i];
    }
}