1 #include<cstdio>
2
3 #include<cstdlib>
4
5 #include<cmath>
6
7 #include<cstring>
8
9 #include<algorithm>
10
11 #include<iostream>
12
13 #include<vector>
14
15 #include<map>
16
17 #include<set>
18
19 #include<queue>
20
21 #include<string>
22
23 #define inf 1000000000
24
25 #define maxn 500+100
26
27 #define maxm 500+100
28
29 #define eps 1e-10
30
31 #define ll long long
32
33 #define pa pair<int,int>
34
35 #define for0(i,n) for(int i=0;i<=(n);i++)
36
37 #define for1(i,n) for(int i=1;i<=(n);i++)
38
39 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
40
41 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
42
43 #define mod 1000000007
44
45 using namespace std;
46
47 inline int read()
48
49 {
50
51 int x=0,f=1;char ch=getchar();
52
53 while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
54
55 while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}
56
57 return x*f;
58
59 }
60 int c[20][20],v[500],ans[20][20],n;
61 ll m,t,f[500];
62 ll calc()
63 {
64 ll ret=1;
65 for1(i,t)if(!v[i]&&ret<2e18)ret*=f[i];
66 return ret;
67 }
68
69 int main()
70
71 {
72
73 freopen("input.txt","r",stdin);
74
75 freopen("output.txt","w",stdout);
76
77 cin>>n>>m;
78 for1(i,n)
79 for1(j,n)
80 if(!c[i][j])
81 {
82 f[++t]=4;
83 for(int k=1,x=i,y=j;k<=4;k++)
84 swap(x,y),x=n-x+1,c[x][y]=t;
85 }
86 m=((ll)1<<(2*t))-m+1;
87 for1(i,n)
88 for1(j,n)
89 if(!v[c[i][j]])
90 {
91 v[c[i][j]]=1;
92 ll tmp=calc();
93 if(tmp>=m)ans[i][j]=1;
94 else m-=tmp,f[c[i][j]]--,v[c[i][j]]=0;
95 }
96 for1(i,n)
97 {
98 for1(j,n)if(ans[i][j])printf("1");else printf("0");
99 printf("\n");
100 }
101
102 return 0;
103
104 }
