#include <cstdio>
#include <vector>
using namespace std;
vector<int> v, aux;
const int MASK = 255;

void radix(int N, int step) {
  vector<int> bucketFrequency(MASK+1);
  for (int i = 1; i <= N; ++i)
    ++bucketFrequency[(v[i] >> (8 * step)) & MASK];
  for (int i = 1; i <= MASK; ++i)
    bucketFrequency[i] += bucketFrequency[i - 1];
  for (int i = N; i >= 1; --i)
    aux[bucketFrequency[(v[i] >> (8 * step)) & MASK]--] = v[i];
  swap(aux, v);
}

int main()
{
  freopen("radixsort.in", "r", stdin);
  freopen("radixsort.out", "w", stdout);
  int N, A, B, C;
  scanf("%d%d%d%d", &N, &A, &B, &C);
  v.resize(N + 1); aux.resize(N + 1);
  v[1] = B;
  for (int i = 2; i <= N; ++i) 
    v[i] = ((long long)A * ((long long)v[i - 1]) + (long long)B) % C;
  for (int i = 0; i < 4; ++i)
    radix(N, i);
  for (int i = 1; i <= N; i += 10)
    printf("%d ", v[i]);
  printf("\n");
  return 0;
}