// O( N ) 

#include <cstdio>

#define MN (1<<20)

int N, col[MN], next[MN], op[MN][3], repos[MN];

int find( int x )
{
    if( repos[x] == x )
        return x;
    return repos[x] = find( repos[x] );    
}

void doit( int A, int B, int C )
{
    int last = -1;
    
    for( int i = A; i <= B; i++ )
    {
         if( !col[i] )
         {
             if( last == -1 )
                 last = i;
             
             repos[i] = find(last);
             col[i] = C;    
         }
         else
         {
             if( last != -1 )
             {
                 if( last > 0 && col[ last - 1 ] )
                     repos[last] = find( last - 1 );
                 
                 next[ find(last) ] = i - 1;
                 last = -1;
             }
             
             while( repos[i] != i )
                    i = repos[i];
             i = next[i];
         }
    }
    
    if( last != -1 )
             {
                 if( last > 0 && col[ last - 1 ] )
                     repos[last] = find( last - 1 );
                 
                 next[ find(last) ] = B;
                 last = -1;
             }
}

int main()
{
    freopen("curcubeu.in", "r", stdin);
    freopen("curcubeu.out", "w", stdout);
    
    int A, B, C;
    scanf("%d %d %d %d", &N, &A, &B, &C);
    
    for( int i = 0; i < N - 1; i++ )
         next[i] = i, repos[i] = i;
         
    for( int i = 2 ; i <= N; i++ )
    {
        if( A > B ){ int aux = A; A = B; B = aux; } 
        
        op[i-1][0] = A - 1, op[i-1][1] = B - 1, op[i-1][2] = C;
        
        A = ( (long long)(A) * i ) % N,
        B = ( (long long)(B) * i ) % N,
        C = ( (long long)(C) * i ) % N;  
    }
    
    for( int i = N - 1; i >= 1; --i )
        doit( op[i][0], op[i][1], op[i][2] );
    
    for( int i = 0; i < N - 1; i++ )
         printf("%d\n", col[i]);
    
    return 0;  
}