#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
int n,a,b,c,pre;
std::vector<int> x;
int main()
{
    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);
    scanf("%d %d %d %d",&n,&a,&b,&c);
    x.push_back(b);
    pre = b;
    for(int i=2;i<=n;++i)
    {
        pre = (a*pre+b)%c;
        x.insert(upper_bound(x.begin(),x.end(),pre),pre);
    }
    for(int i=0;i<x.size();i+=10)printf("%d ",x[i]);
    return 0;
}