#include <cstdio>
#include <algorithm>

const int Q=10000010;

long long v[Q];
int n,a,b,c;

void inline make_nr()
{


    scanf("%d%d%d%d",&n,&a,&b,&c);

    v[1]=b;

    for(int i=2; i<=n; i++)
    {
        v[i]=(a*v[i-1] + b)%c;
    }
}

int main()
{
    freopen("radixsort.in","r",stdin);
    freopen("radixsort.out","w",stdout);

    make_nr();

    std::stable_sort(v+1,v+n+1);

    for(int i=1; i<=n; i+=10)
        printf("%d ",v[i]);


    return 0;
}