#include <stdio.h>
#include <vector>
#include <algorithm>
#define NMax 10000006
using namespace std;
int n,a,b,c,maxi,x[NMax];

void _countSort(int per)
{
    int out[n+100];
    int countV[12] = {0};
    for(int i=1;i<=n;++i)
    {
        countV[ (x[i]/per)%10 ]++;
    }
    for(int i=1;i<10;++i)
    {
        countV[i] += countV[i-1];
    }
    for(int i=n;i>=1;--i)
    {
        out[ countV[ (x[i]/per)%10 ] ] = x[i];
        --countV[ (x[i]/per)%10 ];
    }
    for(int i=1;i<=n;++i)
    {
        x[i] = out[i];
    }
}

void radix_sort(int maxi)
{
    for(int per=1;per<=maxi;per*=10)
    {
        _countSort(per);
    }
}

int main()
{
    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);
    scanf("%d %d %d %d",&n,&a,&b,&c);
    x[1] = b;
    for(int i=2;i<=n;++i)
    {
        x[i] = (a * x[i-1] + b) % c;
        if(x[i]>maxi)maxi = x[i];
    }
    radix_sort(maxi);
    for(int i=1;i<=n;i+=10)printf("%d ",x[i]);
    return 0;
}