#include <fstream>
#include <vector>

using namespace std;

#define base 100

vector <int> w[105];
int v[10000005],i,j,n,a,b,c,k;

int main()
{
    ifstream f("radixsort.in");
    ofstream g("radixsort.out");
    f >> n >> a >> b >> c;
    v[1]=b;
    for (i=2;i<=n;i++)
        v[i]=(a*v[i-1]+b)%c;
    c=max(b,c);
    for (i=1;i<=c;i*=base)
    {
        for (j=1;j<=n;j++)
            w[v[j]/i%base].push_back(v[j]);
        k=0;
        for (j=0;j<base;j++)
        {
            for (int t=0;t<w[j].size();t++)
                v[++k]=w[j][t];
            while (!w[j].empty())
                w[j].pop_back();
        }
    }
    for (i=1;i<=n;i+=10)
        g << v[i] << ' ';
    return 0;
}