#include <cstdio>
#include <deque>
using namespace std;

int N, A, B, C;
deque<int> q[257];
int v[10000001];

int main(){

freopen("radixsort.in", "r", stdin);
freopen("radixsort.out", "w", stdout);

scanf("%d %d %d %d", &N, &A, &B, &C);

v[1] = B;

for(int i = 2; i <= N; i++){
    v[i] = (1LL * A * v[i-1] + B) % C;
}
for(int j = 0; j < 4; j++){
    for(int i = 1; i <= N; i++){
        q[(v[i] >> (8 * j)) & 255].push_back(v[i]);
    }int index = 0;

    for(int i = 0; i < 256; i++){
        while(!q[i].empty()){
            v[++index] = q[i].front();
            q[i].pop_front();
        }
    }
}
for(int i = 1; i <= N; i += 10){
    printf("%d ", v[i]);
}
return 0;
}