#include <queue>
#include <fstream>
#include <vector>
using namespace std;

ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

unsigned int n, a, b, c, i, j, maxim, exp, v[10000100];
vector <unsigned int> cifra[260];

void sortare(unsigned int putere){
    for(i=0; i<=255; i++){
        cifra[i].clear();
    }
    for(i=1; i<=n; i++){
        unsigned int x=(v[i]/putere)%256;
        cifra[x].push_back(v[i]);
    }
    unsigned int k=0;
    for(i=0; i<=255; i++){
        for(j=0; j<cifra[i].size(); j++){
            k++;
            v[k]=cifra[i][j];
        }
    }
}

int main(){
    fin>>n>>a>>b>>c;
    v[1]=b%c;
    maxim=b;
    for(i=2; i<=n; i++){
        v[i]=(a*v[i-1]%c+b)%c;
        maxim=max(maxim, v[i]);
    }
    for(exp=1; exp<=maxim; exp*=256){
        sortare(exp);
    }
    for(i=1; i<=n; i+=10){
        fout<<v[i]<<" ";
    }
}