#include <fstream>
#include <algorithm>

using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
long long n,A,B,C,a[10000002];
int main()
{
    f>>n>>A>>B>>C;
    a[1]=B;
    for(int i=2;i<=n;i++)
    {
        a[i]=(A*a[i-1]+B)%C;
    }
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i=i+10)
    {
        g<<a[i]<<" ";
    }
    return 0;
}