#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

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

int n , a , b , c , x;
int v[10000000];

int main()
{
    f >> n >> a >> b >> c;
    v[1] = b;
    for (int i = 1 ; i <= n ; i++ )
        v[i] = (a*v[i-1]+b)%c;
    sort(v+1 , v+n+1);
    for (int i = 1; i <= n; i += 10 )
        g << v[i] << " " ;
    return 0;
}