#include <fstream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("radixsort.in");
ofstream fout ("radixsort.out");
long long n,a,b,c,v[10000005];
int main()
{
    fin >> n >> a >> b >> c;
    for (int i=2;i<=n;i++)
    {
        v[1]=b;
        v[i]=(a*v[i-1]+b)%c;
    }
    sort(v+1,v+n+1);
    for (int i=1;i<=n;i+=10)
    {
        fout <<v[i] << ' ';
    }
    return 0;
}