#include<fstream>
#include<vector>
using namespace std;

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

const int Nmax=10000005;

int n,A,B,C,nr,puteri[20];
int a[Nmax];
vector<int>v[9999];

inline void REZ()
{
    int i,cifra,len,j,l,pas=-4;
    while (nr<=2)
        {
            nr++;pas+=4;
            for (i=0;i<=9999;i++) v[i].clear();
            for (i=1;i<=n;i++)
                v[(a[i]/puteri[pas])%puteri[4]].push_back(a[i]);
            j=0;
            for (i=0;i<=9999;i++)
                {
                    len=v[i].size();
                    for (l=0;l<len;l++)
                        a[++j]=v[i][l];
                }
        }
}

int main()
{
    int i;
    fin>>n>>A>>B>>C;
    a[1]=B;
    for (i=1;i<=n;i++)  a[i]=(1LL*A*a[i-1]+B)%C;
    puteri[0]=1;
    for (i=1;i<=15;i++) puteri[i]=puteri[i-1]*10;
    REZ();
    for (i=1;i<=n;i+=10) fout<<a[i]<<" ";
    fout<<"\n";
    return 0;
}