#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");


const int MAX=1e7;
long long A,B,C,D;
int n,nr,v[MAX+5],i;
int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(0); fout.tie(0);

    fin>>n>>A>>B>>C;

    v[1]=B;

    for (i=2; i<=n; i++)
    {
        D=v[i-1];
        v[i]=(A*D+B)%C;
    }

    sort(v+1,v+n+1);

    for (i=1; i<=n; i+=10)
        fout<<v[i]<<" ";

    return 0;
}