/*#include <fstream>

using namespace std;

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

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

    int d = 1;

    for(short y = 1; y<=q; y++)
    {
        for(short i = 0; i<=9; i++)
        {
            m[i][0] = 0;
        }

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

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

        int ind = 0;
        for(short i = 0; i<=9; i++)
        {
            for(int j = 1; j<=m[i][0]; 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 <cstring>

using namespace std;

ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

#define MAX_N 10000000 + 1
#define RADIX 0xFF
#define RADIX_SIZE 8
#define TOTAL_BYTES sizeof(numbers[0])

int n;
int numbers[MAX_N];

#define get_byte(x) ((x>>(byte * 8))&RADIX)

void countsort(int A[], int B[], int byte) {
    int counter[1<<RADIX_SIZE];
    int index[1<<RADIX_SIZE];

    memset(counter, 0, sizeof(counter));

    for(int i = 0; i < n; i ++)
        ++counter[get_byte(A[i])];

    index[0] = 0;

    for(int i = 1; i < 1<<RADIX_SIZE; i ++)
        index[i] = index[i-1] + counter[i-1];

    for(int i = 0; i < n; i ++)
        B[index[get_byte(A[i])]++] = A[i];
}
void radixsort() {
    int *temp = new int[n]; // avem nevoie de un array ca spatiu temporar
    for (int i = 0; i < TOTAL_BYTES; i ++) {
        if(i % 2 == 0)
            countsort(numbers, temp, i);// sortez dupa byte-ul i
        else
            countsort(temp, numbers, i);
    }
}
void read()
{
    int a,b,c;
    fin>>n>>a>>b>>c;

    numbers[0] = b % c;
    for(int i = 1; i < n; i ++)
        numbers[i] = (1LL * a * numbers[i-1] % c + b) % c;
}
void write(ofstream& f)
{
    for(int i = 0; i < n; i +=10)
        f << numbers[i]<< ' ';
    f<<endl;
}

int main()
{
    read();

    radixsort();
//    sort(numbers, numbers + n);

    write(fout);

    return 0;
}