#include <bits/stdc++.h>

using namespace std;

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

const int nmax=1e7+5;

int n, v[nmax];

int a[nmax], fr[10];

void countsort (int v[], int n, long long exp)
{
    for (int i=0; i<=9; i++)
        fr[i]=0;
    for (int i=1; i<=n; i++)
    {
        a[i]=0;
        fr[(v[i]/exp)%10]++;
    }
    for (int i=1; i<=9; i++)
        fr[i]+=fr[i-1];
    for (int i=n; i>=1; i--)
    {
        a[fr[(v[i]/exp)%10]]=v[i];
        fr[(v[i]/exp)%10]--;
    }
    for (int i=1; i<=n; i++)
        v[i]=a[i];
}

void radixsort (int v[], int n)
{
    int m=0;
    for (int i=1; i<=n; i++)
        m=max(m,v[i]);
    for (int i=1, exp=1; m/exp>0; i++, exp*=10)
        countsort(v,n,exp);
}

int main()
{
    int a, b, c;
    cin >> n >> a >> b >> c;
    v[1]=b;
    for (int i=2; i<=n; i++)
        v[i]=(a*1LL*v[i-1]+b)%c;
    //radixsort(v,n);
    for (int i=1; i<=n; i++)
        cout << v[i] << " ";
    return 0;
}