#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=5e5+10;
const int mo=998244353;
int n,m,k,x,y,z,a[N],b[N],sum,manx;
vector<vector<pair<int,int> > > v(200);
vector<vector<pair<int,int> > > q(200);
int add(int index,int o)
{
//	cout<<index<<" "<<o<<endl;
	v[index].push_back({k,o});
	k++;
	return k-1;
}
void qadd(int index,int y,int o)
{
//	cout<<index<<" "<<y<<" "<<o<<endl;
	q[index].push_back({y,o});
	manx=max(y,manx);
}
int gt(int x,int y)
{
	if(y==0)
	{
		return x;
	}
	return x+(1<<y)-1;
}
void dfs(int index,int s,int y)
{
//	cout<<"dfs:"<<index<<" "<<s<<" "<<y<<endl;
	if(gt(s,y)<=m&&s>=n)
	{
		//0
		qadd(index,y,0);
	}
	else if(y!=0&&gt(s,y)>=n)
	{
		int newIndex=add(index,0);
		dfs(newIndex,s,y-1);
	}
	if(gt(s+(1<<y),y)<=m&&s+(1<<y)>=n)
	{
		//1
		qadd(index,y,1);
	}
	else if(s+(1<<y)<=m&&y!=0)
	{
		int newIndex=add(index,1);
		dfs(newIndex,s+(1<<y),y-1);
	}
	
	
}
void solve()
{
	cin>>n>>m;
	k=2;
	if(n==1)
	{
		qadd(1,0,1);
	}
	for(int i=1;i<=30;i++)
	{
		x=(1<<i);
		if(x>m)
		{
			break;
		}
		if(x*2>n)
		{
			int index=add(1,1);
			dfs(index,x,i-1);	
		}
	}
	int l=k;
	l++;
	for(int i=1;i<=manx;i++)
	{
		v[l].push_back({l-1,1});
		v[l].push_back({l-1,0});
		l++;
	}
	for(int i=1;i<k;i++)
	{
		for(auto[x,y]:q[i])
		{
			v[i].push_back({k+x,y});
		}
	}
	cout<<l-1<<endl;
	for(int i=1;i<l;i++)
	{
		cout<<(v[i].size());
		for(auto[x,y]:v[i])
		{
			cout<<" "<<x<<" "<<y;
		}
		cout<<endl;
	}
}
signed main(){
	int t=1;
//	cin>>t;
	while(t--)
	{
		solve();
	}
}
//1 2 1 2  1,1
//1 3 1 3  1,1
//2 3 2 3  1,1,2