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

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

int n,a,b,c;
int v[10000003];

int main() {

    in >> n >> a >> b >> c;

    v[0] = b;
    for(int i = 1; i < n; i++)
        v[i] = (a*v[i-1]+b)%c;

    sort(v, v+n);

    for(int i = 0; i < n; i += 10)
        out << v[i] << " ";

    return 0;
}