#include <bits/stdc++.h>
#define all(cont) cont.begin(), cont.end()
#define pb push_back
#define fi first
#define se second
#define DEBUG(x) cerr << (#x) << ": " << (x) << '\n'

using namespace std;

typedef pair <int, int> pii;
typedef vector <int> vi;
typedef long long ll;
typedef unsigned long long ull;

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

const int SHIFT = 8;
const int NMAX = 1e7 + 5;

ll n, a, b, c;
int v[2][NMAX];
int cnt[(1 << SHIFT) + 5], idx[(1 << SHIFT) + 5];

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
#ifdef LOCAL_DEFINE
  freopen (".in", "r", stdin);
#endif

  int now = 0, old = 1;
  f >> n >> a >> b >> c;
  v[now][1] = b;

  for (int i = 2; i <= n; ++i) {
    v[now][i] = (1LL * a * v[now][i - 1] + b) % c;
  }

  int and_val = (1 << SHIFT) - 1;

  for (int bits = 0; bits < 4; ++bits) {
    for (int i = 1; i <= n; ++i) {
      ++cnt[((v[now][i] >> (bits * SHIFT)) & and_val)];
    }

    idx[0] = 1;
    for (int i = 1; i <= (1 << SHIFT); ++i) {
      idx[i] = idx[i - 1] + cnt[i - 1];
      cnt[i - 1] = 0;
    }

    for (int i = 1; i <= n; ++i) {
      v[old][idx[((v[now][i] >> (bits * SHIFT)) & and_val)]++] = v[now][i];
    }
    swap (now, old);
  }

  for (int i = 1; i <= n; i += 10) {
    g << v[old][i] << ' ';
  }

  f.close();
  g.close();
  return 0;
}