#include <algorithm>
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("radixsort.in");
ofstream fout("radixsort.out");
int n,a,b,c,i;
int main()
{
        fin>>n>>a>>b>>c;
        ///n numere, generate astfel v[1]=b v[i]= (a * v[i-1] +b)% c
        ///si sortez numerele dp pozitiile 1,11,21.. din 10 in 10
        vector <int> v(n);
        v[1] = b;
        for(i=2;i<=n;i++)
            v[i] = (a * v[i-1] + b) % c;

        int m = *max_element(v.begin(), v.end());
        cout<<m;

        for(i=1;i<=n;i+=10)
            fout<<v[i]<<" ";
        return 0;
}