#include <fstream>

using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
int n, A, B, C, a [10000005], b[10000005], nr[20];
void radix()
{
    int r= 1e9, p = 1;
    while(p <= r)
    {
        for(int i = 1; i < 10; i++)
            nr[i] = 0;
        for(int i = 1; i <= n; i++)
            nr[a[i] / p % 10]++;
        for(int i = 1; i < 10; i++)
            nr[i] += nr[ i - 1];
        for(int i = n; i > 0; i--)
        {
            b[nr[a[i] / p % 10]] = a[i];
            nr[a[i] / p % 10]--;
        }
        for(int i = 1;i <= n; i++)
            a[i] = b[i];
        p *= 10;
    }
}
int main()
{
    f>> n >> A >> B >> C;
    a[1] = B;
    for(int i = 2; i <= n; i++)
        a[i] =(1LL * a[i-1] * A + B) % C;
    radix();
    for(int i = 1; i <= n; i += 10)
        g<< a[i] << " ";
    return 0;
}