#include <iostream>
#include <fstream>

using namespace std;

ifstream f("radixsort.in");
ofstream g("radixsort.out");

int getMax(int array[], int n) {
  int max = array[0];
  for (int i = 1; i < n; i++)
    if (array[i] > max)
      max = array[i];
  return max;
}

void countingsort(int array[], int size, int place) {
  int output[size];
  int count[10];

  for (int i = 0; i < 10; ++i)
    count[i] = 0;
  for (int i = 0; i < size; i++)
    count[(array[i] / place) % 10]++;
  for (int i = 1; i < 10; i++)
    count[i] += count[i - 1];
  for (int i = size - 1; i >= 0; i--) {
    output[count[(array[i] / place) % 10] - 1] = array[i];
    count[(array[i] / place) % 10]--;
  }
  for (int i = 0; i < size; i++)
    array[i] = output[i];
}

void radixsort(int array[], int size) {
  int max = getMax(array, size);
  for (int place = 1; max / place > 0; place *= 10)
    countingsort(array, size, place);
}

int main() {
    long int v[10000000],n,a,b,c;
    f>>n>>a>>b>>c;
    for(int i=0;i<n;i++)
        if(!i)
            v[i] = b;
        else
            v[i] = (a*v[i-1]+b)%c;
    radixsort(v, n);
    for(int i=0;i<n;i+=10)
        g<<v[i] << " ";
}