#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin ("radixsort.in");
class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};
OutParser fout("radixsort.out");
const long long BAZA=100000;
int n,V[10000002],aux[10000002],f[BAZA],A,B,C,maxim;
void count_sort(long long digit)
{
    memset(f,0,sizeof(f));
    for(int i=1;i<=n;i++)
        f[(V[i]/digit)%BAZA]++;
    for(int i=1;i<BAZA;i++)
        f[i]+=f[i-1];
    for(int i=n;i>=1;i--)
        aux[f[(V[i]/digit)%BAZA]--]=V[i];
    for(int i=1;i<=n;i++)
        V[i]=aux[i];
}
void radix_sort()
{
    for(long long d=1;maxim/d>0;d*=BAZA)
        count_sort(d);
}
int main()
{
	fin>>n>>A>>B>>C;
	maxim=B;
    V[1]=B;
    for(int i=2;i<=n;i++)
    {
        V[i]=(A*1LL*V[i-1]+B)%C;
        maxim=max(maxim,V[i]);
    }
    radix_sort();
    for(int i=1;i<=n;i+=10)
        fout<<V[i]<<" ";
	return 0;
}