#include<bits/stdc++.h>
    #define rep(i,a,b) for(int i=(a);i<=(b);++i)
    #define per(i,a,b) for(int i=(a);i>=(b);--i)
    #define pb push_back
    #define eb emplace_back
    #define SZ(x) ((int)(x).size())
    #define D(...) fprintf(stderr,__VA_ARGS__)
    using namespace std;
    using LL=long long;
    unsigned long long C[60][60];
    #ifdef xay5421
    int vis[1005][2][1005][2];
    #endif
    int main(){
    #ifdef xay5421
    	freopen("a.in","r",stdin);
    #endif
    	int n,w;
    	cin>>n>>w;
    	rep(i,0,59){
    		C[i][0]=1;
    		rep(j,1,i){
    			C[i][j]=C[i-1][j-1]+C[i-1][j];
    		}
    	}
    	int x=1;
    	while(C[x][x/2]<n)++x;
    	int flag=0;
    	if (C[x][x/2-1]>=n){
    		flag=1;
    	}
    	vector<int>v;
    	rep(i,0,(1<<x)-1){
    		if(__builtin_popcount(i)==x/2-flag){
    			v.push_back(i);
    		}
    	}
    	rep(i,0,x-1){
    		rep(j,i,SZ(v)-1){
    			if(~v[j]>>(i>>1)&1){
    				swap(v[i],v[j]);
    				break;
    			}
    		}
    	}
    	// D("x=%d\n",x);
    	vector<string>s(x);
    	rep(i,0,x-1){
    		rep(j,0,n-1){
    			s[i].push_back(v[j]>>i&1?'1':'2');
    		}
    	}
    	{
    		if((~x&1)&&!flag){
    			s.push_back("");
    			rep(j,0,n-1)s.back().push_back('2');
    			x+=1;
    		}
    		s.push_back("");
    		rep(j,0,n-1)s.back().push_back('1');
    		x+=1;
    	}
    	if(w<x){
    		puts("infinity");
    		exit(0);
    	}
    #ifdef xay5421
    	for(int i=0;i<x;i++)
    	{
    		for(int j=0;j<n;j++) for(int k=j+1;k<n;k++) vis[j][s[i][j]-'1'][k][s[i][k]-'1']=1;
    	}
    	for(int i=0;i<n;i++) for(int c=0;c<2;c++)
    	{
    		for(int j=i+1;j<n;j++) for(int d=0;d<2;d++) printf("%d",vis[i][c][j][d]);
    	}
    	cout<<"\n";
    #endif
    	
    	printf("%d\n",x);
    	rep(i,0,w-1){
    		cout<<s[i%x]<<'\n';
    	}
    	return 0;
    }