#include <bits/stdc++.h>

using namespace std;

priority_queue <int, vector<int>, greater<int> > H;

int N, X, AUX;

long long A, B, C;

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

    scanf("%d%d%d%d", &N, &A, &B, &C);

    H.push(B);

    AUX=B;

    for(int i=2; i<=N; i++)
    {
        X=(A*AUX+B)%C;

        H.push(X);

        AUX=X;
    }

    for(int i=1; i<=N; i++)
    {
        if(i%10==1)
            printf("%d ", H.top());

        H.pop();
    }

    printf("\n");

    return 0;
}