#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

long long n, a, b, c, x, y;
long long v[10000010], nr[10000010];

int main()
{
    in>>n>>a>>b>>c;
    v[0]=b;
    long long i;
    for(i=1;i<n;i++)
    {
        v[i]=v[i-1]*a+b;
        v[i]%=c;
    }

    sort(v,v+n);
    for(i=0;i<n;i+=10)
        out<<v[i]<<' ';


    return 0;
}