#include <bits/stdc++.h>

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[10], trash[10000005];

void radixBy(int dv);

int main()
{

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

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

    for(int dv = 1; mx / dv; dv *= 10)
        radixBy(dv);

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

    return 0;
}

void radixBy(int dv){

    for(int i = 0; i < 10; ++i) cnt[i] = 0;
    for(int i = 1; i <= n; ++i){
        ++cnt[(nums[i] / dv) % 10];
    }

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

    for(int i = n; i; --i){
        trash[cnt[(nums[i] / dv) % 10]--] = nums[i];
    }

    for(int i = 1; i <= n; ++i) nums[i] = trash[i];

}