#include <cstdio>
#include <deque>

using namespace std;

const int NMAX = 10000005;
int N, A, B, C;
int v[NMAX];
deque <int> bucket[260];

int main()
{
    FILE *fin = fopen("radixsort.in", "r");
    FILE *fout = fopen("radixsort.out", "w");
    fscanf(fin, "%d %d %d %d", &N, &A, &B, &C);
    v[1] = B;
    for (int i = 2;i <= N;++i)
        v[i] = (1LL * A * v[i - 1] + B) % C;
    for (int p = 0;p < 4;++p)
    {
        for (int i = 1;i <= N;++i)
        {
            int val = (v[i] >> (8 * p)) & 255;
            bucket[val].push_back(v[i]);
        }
        N = 0;
        for (int i = 0;i < 256;++i)
        {
            while (!bucket[i].empty())
            {
                v[++N] = bucket[i].front();
                bucket[i].pop_front();
            }
        }
    }
    for (int i = 1;i <= N;i += 10)
        fprintf(fout, "%d ", v[i]);
    fclose(fin);
    fclose(fout);
    return 0;
}