#include <bits/stdc++.h>

using namespace std;

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;
    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }
public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }
    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }
    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

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

#define MAX_N 10000000
#define RADIX 65535
#define RADIX_SIZE 16
#define get_byte(x) ((x >> (byte * 16)) & RADIX)

int n, numbers[MAX_N], temp[MAX_N];

void CountSort (int A[], int B[], int byte) {
  int counter[1 << RADIX_SIZE], 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];
}

int main () {
  int a, b, c;
  fin.sync_with_stdio(false);
  fin >> n >> a >> b >> c;
  numbers[0] = b % c;
  for (int i = 1; i < n; i ++)
    numbers[i] = ((long long)a * numbers[i - 1] % c + b) % c;
  for (int i = 0; i < 2; i ++)
    if (i & 1)
      CountSort (temp, numbers, i);
    else
      CountSort (numbers, temp, i);
  for (int i = 0; i < n; i += 10)
    fout << numbers[i] << ' ';
  return 0;
}