///#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

typedef long long ll;

const int N=1000000;

int v[N+5];
ll n,a,b,c;
ll val;

int main()
{
    fin>>n>>a>>b>>c;
    v[1]=val=b;
    for(int i=2;i<=n;i++)
    {
        val=(a*val+b)%c;
        v[i]=val;
    }
    for(int i=1;i<=n;i+=10)
    {
        nth_element(v+1,v+i,v+n+1);
        fout<<v[i]<<" ";
    }
    return 0;
}
/**
**/