#include <stdio.h>
int v[101];
void QUICKSORT( int inf,int sup )
{
    int med, i=inf, j=sup, aux;
    med=v[(i+j)/2];
    do
    {
        while( (i<sup) && (v[i]<med) )
            i++;
        while( (j>inf) && (v[j]>med) )
            j--;
        if( i<=j )
            aux=v[i], v[i]=v[j], v[j]=aux, i++, j--;
    }
    while( i<=j );
    if( inf<j )
        QUICKSORT(inf,j);
    if( i<sup )
        QUICKSORT(i,sup);
}
int main()
{
    freopen( "loto.in", "r", stdin );
    freopen( "loto.out", "w", stdout );
    int n, s, i, j;
    scanf( "%d%d", &n, &s );
    if( n==1 )
        for( i=1; i<=s; i++ )
            printf( "%d ", v[1] );
    else
    {
        for( i=1; i<=n; i++ )
            scanf( "%d", &v[i] );
        QUICKSORT(1,n);
        for( i=n; v[i]!=0 && i>0 && s>0; i-- )
            if( s>=v[i] )
            {
                for( j=1; j<=s/v[i]; j++ )
                    printf( "%d ", v[i] );
                s=s%v[i];
            }
    }
    return 0;
}