#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("radixsort.in");
ofstream g("radixsort.out");
 vector <int> v[1<<16];
 int n,aa,b,c,x;
int main()
{ int i,j,k;
    f>>n>>aa>>b>>c;

      x=b;
      v[b-((b>>16)<<16)].push_back(b);

    for(i=2;i<=n;i++)
     { x=((long long)aa*x+b)%c;
       v[x-((x>>16)<<16)].push_back(x);
     }




    return 0;
}