#include <bits/stdc++.h>
#define RADIX 0xff
#define RADIX_SIZE 256
#define LAST_BYTE(x) ((x >> (dv * 8)) & RADIX)
#define BYTES sizeof(nums[0])

using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
typedef long long ll;

int n, a, b, c, mx;
int nums[10000005], cnt[256], trash[10000005];

void radixBy(int dv, int a[], int b[]);

int main()
{

    fin >> n >> a >> b >> c;
    nums[1] = mx = b % c;

    for(int i = 2; i <= n; ++i){
        nums[i] = (1LL * a * nums[i - 1] % c + b) % c;
        mx = max(mx, nums[i]);
    }

    for(int i = 0; i < BYTES; ++i){
        if(!(i & 1)) radixBy(i, nums, trash);
        else radixBy(i, trash, nums);
    }

    for(int i = 1; i <= n; i += 10){
        fout << nums[i] << " ";
    }

    return 0;
}

void radixBy(int dv, int a[], int b[]){
    memset(cnt, 0, sizeof(cnt));

    for(int i = 1; i <= n; ++i){
        ++cnt[LAST_BYTE(a[i]) + 1];
    }
    cnt[0] = 1;

    for(int i = 1; i < RADIX_SIZE; ++i) cnt[i] += cnt[i - 1];

    for(int i = 1; i <= n; ++i){
        b[cnt[LAST_BYTE(a[i])]++] = a[i];
    }

}