#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

const int N = 1e7;

unsigned v[N], p10[10];

void precalc() {
  p10[0] = 1;
  for (int i = 1; i < 10; ++i)
    p10[i] = p10[i - 1] * 10;
}

void radixSort(unsigned arr[], int sz) {
  int p = 0;
  for (int digit = 0; digit < 10; ++digit) {
    while (p < sz && arr[p] < p10[digit])
      ++p;
    vector<unsigned> bucket[10];
    for (int i = p; i < sz; ++i)
      bucket[arr[i] / p10[digit] % 10].push_back(arr[i]);
    int q = p;
    for (int i = 0; i < 10; ++i)
      for (auto j: bucket[i])
        arr[q++] = j;
  }
}

int main() {
  ifstream cin("radixsort.in");
  ofstream cout("radixsort.out");
  unsigned n, a, b, c;
  cin >> n >> a >> b >> c;
  cin.close();
  v[0] = b;
  for (int i = 1; i < n; ++i)
    v[i] = (1LL * a * v[i - 1] + b) % c;
  precalc();
  radixSort(v, n);
  for (int i = 0; i < n; i += 10)
    cout << v[i] << " ";
  cout.close();
  return 0;
}