#include <fstream>

using namespace std;
int v[10000000];
int nr[9];
int poz[1000000];
int aux[10000000];

ifstream in("radixsort.in");
ofstream out("radixsort.out");

int main()
{
    int n,A,B,C = 0;
    in >> n >> A >> B >> C;
    v[0] = B;
    for(int i = 1; i < n; i++){
        v[i] = ((long long)A * v[i-1] + B) % C;
    }
    int p;
    int baza = 1>>16;
    int NB = 16;
    p = 1;
    for(int k = 0; k < 3; k++){
        int ic = k & 1;
        int ia = 1 - ic;
        int nsh = k * NB;
        for(int j = 0; j < baza; j++){
            nr[j] = 0;
        }
        for(int i = 0; i < n; i++){
            nr[(aux[ic] >> nsh) & (baza - 1)]++;
        }
        poz[0] = 0;
        for(int j = 1; j < baza; j++){
            poz[j] = poz[j-1] + nr[j-1];
        }
        for(int j = 0; j < n; j++){
            aux[poz[v[j]/p%10]++]=v[j];
        }
        for(int j = 0; j < n; j++){
            v[j]=aux[j];
        }
        p*=10;
    }
    for(int i = 0; i < n; i += 10){
        out << v[i];
    }
}