#include<fstream>
#include<queue>
#define nx 10000007
#define baza 256
#define inc 8
using namespace std;
int n,a,b,c,i,j,m,nr[nx];
queue<int>q[baza+1];


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

int main()
{
    fin>>n>>a>>b>>c;

    for(i=1;i<=n;i++)
        nr[i]=((1LL*a*nr[i-1])%c+b)%c;

    m=baza;
    for(int l=0;l<32;l+=inc)
    {
        for(i=1;i<=n;i++)
            q[(nr[i]&(m-1))>>l].push(nr[i]);

        n=0;
        for(i=0;i<baza;i++)
            while(!q[i].empty())
                nr[++n]=q[i].front(),q[i].pop();

        m=m*baza;
    }

    for(i=1;i<=n;i+=10)
        fout<<nr[i]<<" ";

    return 0;
}