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