#include <bits/stdc++.h>

using namespace std;

FILE*f=fopen("radixsort.in","r");
FILE*g=fopen("radixsort.out","w");

int v[10000001];
int n,a,b,c,i,k,j;
queue<int>l[256];

int main()
{
    fscanf(f,"%d%d%d%d",&n,&a,&b,&c);
    v[1]=b;
    for (i=2;i<=n;i++){
        v[i]=(1ll*a*v[i-1]+b)%c;
    }
    for (i=0;i<=24;i+=8){
        for (j=1;j<=n;j++){
            l[(v[j]>>i)&255].push(v[j]);
        }
        k=0;
        for (j=0;j<=255&&k<n;j++)

            while (!l[j].empty()){
                k++;
                v[k]=l[j].front();
                l[j].pop();
            }
    }
    for (i=1;i<=n;i+=10) fprintf(g,"%d ",v[i]);
    fclose(f);
    fclose(g);
    return 0;
}
/*#include <fstream>
#include <queue>

#define N 10000005

using namespace std;

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

int n, v[N];
queue <int> q[256];

void radixsort()
{
    int k;
    for(int i = 0; i <= 24; i += 8)
    {
        for(int j = 1; j <= n; ++j)
            q[(v[j]>>i)&255].push(v[j]);
        k = 0;
        for(int j = 0; j <= 255 && k < n; ++j)
            while(!q[j].empty())
            {
                v[++k] = q[j].front();
                q[j].pop();
            }
    }
}

int main()
{
    int a, b, c;
    fin >> n >> a >> b >> c;
    v[1] = b;
    for(int i = 2; i <= n; ++i)
        v[i] = (1LL * a * v[i-1] + b) % c;
    fin.close();

    radixsort();

    for(int i = 1; i <= n; i++) fout << v[i] << " ";
    fout.close();
    return 0;
}*/