#include <stdio.h>
#include <iostream>
#include <cstring>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#include <string>
#include <vector>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <limits.h>
#include <algorithm>
#include <deque>
#define nmax 10000010
#define mod 1999999973
using namespace std;
int v[nmax],n,a,b,c,i,j,aux[nmax],x[260];
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 (i=2;i<=n;i++) v[i]=(a*1LL*v[i-1]+b)%c;
for (i=0;i<=24;i+=8) {
    memset(x,0,sizeof(x));
    for (j=1;j<=n;j++) x[(v[j]>>i)&255]++;
    for (j=1;j<=255;j++) x[j]=x[j-1]+x[j];
    for (j=n;j>=1;j--) {
        aux[x[(v[j]>>i)&255]]=v[j];
        x[(v[j]>>i)&255]--;
    }
    for (j=1;j<=n;j++) v[j]=aux[j];
}
for (i=1;i<=n;i+=10) printf("%d ",v[i]);
return 0;
}