#include <stdio.h>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <bitset>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <limits.h>
#include <set>
#define nmax 10000010
using namespace std;
int i,j,n,b,c,aux[nmax],v[nmax],x[256];
long long y,a,xx;
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++){
    xx=v[i-1];
    y=((long long)a*xx+b)%c;
    v[i]=y;
}
for (i=1;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;
}