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

size_t v[10000000], A, B, C, N;

int main()
{


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

    fin >> N >> A >> B >> C;

    v[0] = B;

    for(size_t i = 1; i < N; i++) v[i] = (A * v[i - 1] + B) % C;

    sort(v, v + N);

    for(size_t i = 0; i < N; i += 10) fout << v[i] << " ";
}