#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

const int NMAX = 1e7+7;
int n, a, b, c;
static int arr[NMAX];

int main()
{
    fin >> n >> a >> b >> c;
    arr[1] = b;
    for(int i = 2; i <= n; ++ i)
        arr[i] = ((a*1LL * arr[i-1]*1LL + b*1LL) % c*1LL);
    sort(arr + 1, arr + n + 1);
    for(int i = 1; i <= n; i+=10)
        fout << arr[i] << ' ';
}