//acum un an intra in timp :(

/*#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

ifstream f("radixsort.in");
ofstream g("radixsort.out");
int v[10000005];
int n, a, b, c;
int xmax;

void radix_sort()
{
    int q = 0;
    while(xmax != 0)
    {
        q++;
        xmax /= 10;
    }

    int d = 1;

    for(int y = 1; y<=q; y++)
    {
        vector<int> m[10];

        if(y == 1)
        {
            d = 1;
        }
        else
        {
            d = d * 10;
        }

        for(int i = 1; i<=n; i++)
        {
            m[(v[i]/d)%10].push_back(v[i]);
        }

        int ind = 0;
        for(int i = 0; i<=9; i++)
        {
            for(int j = 0; j<m[i].size(); j++)
            {
                ind++;
                v[ind] = m[i][j];
            }
        }
    }
}

int main()
{
    f>>n>>a>>b>>c;
    v[1] = b;
    xmax = v[1];
    for(int i = 2; i<=n; i++)
    {
        v[i] = (1LL*a * v[i-1] % c + b) % c;
        xmax = max(xmax, v[i]);
    }

    radix_sort();

    for(int i = 1; i<=n; i+=10)
    {
        g<<v[i]<<" ";
    }
    return 0;
}*/

#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

int n;
long long a,b,c;
const int nmax = 10000000;

int v[nmax + 5];
int aux[nmax + 5];
int f[260];

void radix_sort()
{
    int mask_bts = 8;
    const int mask = (1<<mask_bts)-1;

    for(int i = 0;i<=31;i+=mask_bts)
    {
        for(int j=0;j<=mask;j++) f[j]=0;
        for(int j=1;j<=n;j++)
            f[(v[j]>>i)&mask]++;
        for(int j=1;j<=mask;j++)
            f[j]+=f[j-1];
        for(int j=n;j>=1;j--)
            aux[f[(v[j]>>i)&mask]] = v[j],f[(v[j]>>i)&mask]--;
        for(int j=1;j<=n;j++)
            v[j]=aux[j];
    }
}

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

    for(int i=1;i<=n;i+=10)
        fout<<v[i]<<' ';

}