#include <fstream>
#include <vector>

using namespace std;

int n, a, b, c, i, j, s[10000001], nrcif, maxi, p, iv, byte;
vector<int> v[256];
vector<int>::iterator it;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

int main() {
  fin >> n >> a >> b >> c;
  s[1] = b;
  for (i = 2; i <= n; i++) {
    s[i] = (a * s[i - 1] + b) % c ;
    if ( s[i] > maxi )
      maxi = s[i];
  }
  for (byte = 0; byte <= 3; byte++) {
    for (i = 0; i <= 255; i++)
      v[i].clear();
    for (i = 1; i <= n; i++) { //pt fiecare element din vectorul s
      c = s[i] >> (byte * 8) & 255; //determinam cifra unitatilor/zecilor/sutelor etc.
      v[c].push_back(s[i]); // si punem elementul s[i] la coada de la "ghiseul" c
    }
    i = 0;
    for (iv = 0; iv <= 255; iv++)  // Punem elementele in s.
      for (it = v[iv].begin(); it != v[iv].end(); it++)
        i++, s[i] = *it;
  }
  for (i = 1; i <= n; i += 10)
    fout << s[i] << ' '; // se cere sa afisam elemente din 10 in 10
  return 0;
}

/*
        --------
11010011110100111101001111010011
--------        --------
                        11111111
                       1       0
        110100111101001111010011
                 110100111101001
s[i] / p10
12345 / 100 = 123 % 10
12345 / 1000 = 12 % 10

  849 770 67 347 201 618 66 495 13 45

     0   1   2   3   4   5   6   7   8   9
   770 201      13     495  66  67 618 849
                        45     347

  770 201 13 495 45 66 67 347 618 849

     0   1   2   3   4   5   6   7   8   9
   201  13           45     66 770     495
       618          347     67
                    849

  201 13 618 45 347 849 66 67 770 495

     0   1   2   3   4   5   6   7   8   9
    13     201 347 495     618 770 849
    45
    66
    67

queue<int> v[10];
*/