1 // include file
2 #include <cstdio>
3 #include <cstdlib>
4 #include <cstring>
5 #include <cmath>
6 #include <cctype>
7 #include <ctime>
8
9 #include <iostream>
10 #include <sstream>
11 #include <fstream>
12 #include <iomanip>
13 #include <bitset>
14
15 #include <algorithm>
16 #include <string>
17 #include <vector>
18 #include <queue>
19 #include <set>
20 #include <list>
21 #include <functional>
22
23 using namespace std;
24
25 // typedef
26 typedef long long LL;
27 typedef unsigned long long ULL;
28 typedef __int64 Bint;
29
30 //
31 #define read freopen("in.txt","r",stdin)
32 #define write freopen("out.txt","w",stdout)
33 #define FORi(a,b,c) for(int i=(a);i<(b);i+=c)
34 #define FORj(a,b,c) for(int j=(a);j<(b);j+=c)
35 #define FORk(a,b,c) for(int k=(a);k<(b);k+=c)
36 #define FORp(a,b,c) for(int p=(a);p<(b);p+=c)
37 #define FORii(a,b,c) for(int ii=(a);ii<(b);ii+=c)
38 #define FORjj(a,b,c) for(int jj=(a);jj<(b);jj+=c)
39 #define FORkk(a,b,c) for(int kk=(a);kk<(b);kk+=c)
40
41 #define FF(i,a) for(int i=0;i<(a);i++)
42 #define FFD(i,a) for(int i=(a)-1;i>=0;i--)
43
44 #define Z(a) (a<<1)
45 #define Y(a) (a>>1)
46
47 const double eps = 1e-6;
48 const double INFf = 1e10;
49 const int INFi = 1000000000;
50 const double Pi = acos(-1.0);
51
52 template<class T> inline T sqr(T a){return a*a;}
53 template<class T> inline T TMAX(T x,T y)
54 {
55 if(x>y) return x;
56 return y;
57 }
58 template<class T> inline T TMIN(T x,T y)
59 {
60 if(x<y) return x;
61 return y;
62 }
63 template<class T> inline void SWAP(T &x,T &y)
64 {
65 T t = x;
66 x = y;
67 y = t;
68 }
69 template<class T> inline T MMAX(T x,T y,T z)
70 {
71 return TMAX(TMAX(x,y),z);
72 }
73
74
75 // code begin
76 int N,S;
77 int mp[21][21];
78 int Getn(int s)
79 {
80 if(s<9) return s+1;
81 return 1;
82 }
83 int main()
84 {
85 read;
86 write;
87 while(scanf("%d %d",&N,&S)!=-1)
88 {
89 memset(mp,0,sizeof(mp));
90 FORi(1,N+1,1)
91 {
92 FORj(1,i+1,1)
93 {
94 mp[j][i]=S;
95 S=Getn(S);
96 }
97 }
98 FORi(1,N+1,1)
99 {
100 if(mp[i][1]) printf("%d",mp[i][1]);
101 else printf(" ");
102 FORj(2,N+1,1)
103 {
104 if(mp[i][j]) printf(" %d",mp[i][j]);
105 else printf(" ");
106 }
107 printf("\n");
108 }
109 }
110 return 0;
111 }
