#include <bits/stdc++.h>
using namespace std;

const int nmax=10000005;
const int bucket=255;

const int mod=1e9+7;

int n,x,y,z,a[nmax],tz[nmax];

int getbyte(int x,int byte){
    return ((x>>(8*byte))&bucket);
}

void byteSort(int byte){
    vector<int>counter(bucket+5);
    for(int i=1;i<=n;i++){
        counter[getbyte(a[i],byte)]++;
    }
    for(int i=1;i<=bucket;i++) counter[i]+=counter[i-1];
    for(int i=n;i>=1;i--){
        tz[counter[getbyte(a[i],byte)]]=a[i];
        counter[getbyte(a[i],byte)]--;
    }
    for(int i=1;i<=n;i++) a[i]=tz[i];
}


int main(){
    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    cin >> n >> x >> y >> z;
    a[1]=y;
    for(int i=2;i<=n;i++) a[i]=((1LL*a[i-1]*x)%z+y)%z;
    for(int byte=0;byte<4;byte++){
        byteSort(byte);
    }
    for(int i=1;i<=n;i+=10) cout << a[i] << ' ';
}