#include <stdio.h>
#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 <map>
#include <limits.h>
#include <algorithm>
#include <deque>
#define inf 0x3f3f3f3f
#define nmax 10000000
#define eps 1e-12
using namespace std;
int aux[nmax],t[nmax],i,j,n,a,b,c,buf[260];
int main(){
freopen("radixsort.in","r",stdin);
freopen("radixsort.out","w",stdout);
scanf("%d %d %d %d",&n,&a,&b,&c);
t[1]=b;
for (i=2;i<=n;i++) t[i]=(a*1LL*t[i-1]+b)%c;
for (i=0;i<25;i+=8) {
    memset(buf,0,sizeof(buf));
    for (j=1;j<=n;j++) buf[(t[j]>>i)&255]++;
    for (j=1;j<=255;j++) buf[j]=buf[j]+buf[j-1];
    for (j=n;j>=1;j--) {
        aux[buf[(t[j]>>i)&255]]=t[j];
        buf[(t[j]>>i)&255]--;
    }
    for (j=1;j<=n;j++) t[j]=aux[j];
}
for (i=1;i<=n;i+=10) printf("%d ",t[i]);
return 0;
}