#include <bits/stdc++.h>
using namespace std;

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

int n, A, B, C, D = 0;
vector<int> a;

int g()
{
    long long r = A;
    D = (r * D + B) % C;
    return D;
}

int show(int const& x)
{
    int i = &x - &a[0];
    if (i%10 == 0)
        fout<<x<<" ";
}


int main()
{

    fin>>n>>A>>B>>C;
    a.resize(n);
    generate(a.begin(), a.end(), g);
    sort(a.begin(), a.end());
    for_each(a.begin(), a.end(), show);

}