#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#define Nmax 10000001
using namespace std;
int n,a,b,c,v[Nmax],v1[Nmax],poz[258],max1,p,k,val;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int main()
{
    int i,j;
    fin>>n>>a>>b>>c;
    v[1]=b;
    max1=v[1];
    for (i=2;i<=n;i++)
    {
        v[i]=(a*v[i-1]+b)%c;
        max1=max(max1,v[i]);
    }
    sort(v+1,v+n+1);
    for (i=1;i<=n;i+=10)
    {
        fout<<v[i]<<" ";
    }
    return 0;
}