#include <iostream>

using namespace std;

int s[20]={0},a,b,c=0,d=0;

struct par
{
    int x,y;
}ab;

par keres(int x[],int g)
{
    a=g+1; b=0; c=0; d=g+1;
    for(int i=1; i<=g; i++)
    {
        if(i!=g)if(x[i]>=x[i+1]+2){d=a; a=i;}
        if(i!=1 && c==0)if(x[i]<=x[i-1]-2){if(b==0)b=i;else c=i;}
            if(a==b-1 && x[a]==x[b]+2 || a==b)if(c!=0)b=c;else a=d;
    }

    if(a>b){swap(a,b);a--;b++;}
    ab.x=a; ab.y=b;
    return ab;
}

int main()
{
    int h,e,a1,a2;
    cin>>h>>e;

    int H[h+1];

    H[1]=e-h*(h-1)/2;
    for(int i=2; i<=h; i++)H[i]=h-i+1;


    for(int i=1; i<=h; i++)cout<<H[i]<<" ";
    /**cout<<endl;
    cout<<keres(H,h).x<<" "<<keres(H,h).y;**/

    a1=keres(H,h).x; a2=keres(H,h).y;
    while(a1<=h && a1>=1 && a2!=0)
    {
        H[a1]--;
        H[a2]++;
        cout<<endl;
        for(int i=1; i<=h; i++)cout<<H[i]<<" ";
        ///cout<<endl;
        ///cout<<a1<<" "<<a2;
        a1=keres(H,h).x; a2=keres(H,h).y;
    }

    return 0;
}