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

using namespace std;

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

long int n,a,b,c,v[10000001];

int main()
{
    fin >> n >> a >> b >> c;
    v[1]=b;
    //cout << v[1] << ' ';
    for(long int i=2;i<=n;i++)
    {
        v[i]=(a*v[i-1]+b)%c;
    }
    sort(v+1,v+n+1);
    for(long int i=0;i<n/10;i++)
    {
        fout << v[i*10+1] << ' ';
    }
    return 0;
}