#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
ifstream cin("radixsort.in");
ofstream cout("radixsort.out");
int N;
long long A,B,C;
vector<int> V;
int main(){
    cin>>N>>A>>B>>C;
    V.reserve(N+5);
    V[1]=B;
    for(int i=2;i<=N;i++)
        V[i]=(A*V[i-1]+B)%C;
    sort(V.begin()+1,V.begin()+N+1);
    for(int i=1;i<=N;i+=10)
        cout<<V[i]<<' ';
}