#include <bits/stdc++.h>

using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int n,a,b,c;
vector<int>elem;
int main()
{
    fin>>n>>a>>b>>c;
    elem.push_back(b);
    for(int i=1;i<n;i++)
        elem.push_back((a*elem[i-1]+b)%c);
    sort(elem.begin(),elem.end());
    int pos=0;
    while(pos<n)
    {
        fout<<elem[pos]<<" ";
        pos+=10;
    }
    return 0;
}