#include <iostream>
#include <cstdlib>
using namespace std;


int st[20],n,top,p, H,E,s=0;
void init(){
    st[top]=st[top-1];

}
int nextel(){
    if (st[top]<E){
        st[top]++; s++;
        return 1;
    }
    else return 0;
}

int valid(){
    if(s>E) return false;
    if(s<E)
        if(top==H) return false;
        else return true;

    return true;
}

int result(){
    return (s==E) &&(top==H);
}

void write(){
    for(int i=H;i>=1;i--)
        cout<<st[i]<<' ';
    cout<<endl;
}

void backtrack(){
    int vk;

    for(int i=1;i<H;i++) st[i]=i;
    st[H]=E-(H*(H-1)/2)-1;
    s=E-1;
    top=H;
    //init();
    while(top>0){
        do {} while ((vk=nextel()) && !valid());
        if (vk)
            if (result())
                write();
            else {
                top++;init();s=s+st[top];}
        else{
           s=s-st[top]; top--;
        }
    }
}

int main(){
    cin>>H;
    cin>>E;

    backtrack();
}