#include <fstream>
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int n,a,b,c,i,v[1900000],d,ok,aux;
int main()
{
    fin>>n>>a>>b>>c;
    v[1]=b;
    d=1;
    for(i=2;i<=n;i++)
      v[i]=(a*v[i-1]+b)%c;


    do
    {
        ok=1;
        for(i=1;i<n;i++)
            if(v[i]>v[i+1])
        {
            aux=v[i];
            v[i]=v[i+1];
            v[i+1]=aux;
            ok=0;
        }
    }while(ok==0);

    do
    {
        fout<<v[d]<<" ";
        d=d+10;
    }while(d<=n);

    return 0;
}