#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("radixort.in") ;
ofstream g("radixsort.out") ;
int n , a , b , c , i , x , v[10000];
int main()
{
    set < int > s ;
    set < int > :: iterator it ;
    f >> n >> a >> b >> c ;
    x = b ; v[b] ++ ;
    s.insert( b ) ;
    for ( i = 2 ; i <= n ; i ++ )
    {
        x = ( a * x + b ) % c ; v[x] ++ ;
        s.insert( x ) ;
    }
    x = 1 ;
    for ( it = s.begin() ; it != s.end() ; it ++ ){
            for( i = 1 ; i <= v[*it] ; i ++ ){
                   if( x % 10 == 1 )
                       g << *it << " " ;
                   x ++ ;
            }
    }
}