#include <fstream>
#include <queue>

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])
#define get_byte(x) ((x>>(byte * 8))&RADIX)

int n;
int numbers[MAX_N];
queue<int> counter[1<<RADIX_SIZE+1];

void countsort(int byte) {
    for(int i = 0; i < n; i++)
        counter[get_byte(numbers[i])].push(numbers[i]);
    int c = 0;
    for(int i = 0; i <= 1<<RADIX_SIZE; i++) {
        while(!counter[i].empty()) {
            numbers[c++] = counter[i].front();
            counter[i].pop();
        }
    }
}
void radixsort() {
    for (int i = 0; i < TOTAL_BYTES; i ++)
        countsort(i);
}

int main() {
    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;

    radixsort();

    for(int i = 0; i < n; i +=10)
        fout << numbers[i]<< ' ';
    fout<<endl;

    return 0;
}