#include<bits/stdc++.h>
using namespace std;

int aim;
int st1,st2;
int ls,ld,st,ed;
int bs[22],bd[22];

int hd,top;
int cnt[110];

struct node{
	int to,val;
	node(int TO,int VAL):to(TO),val(VAL) {}
	bool operator < (const node &another) const{
		return to<another.to;
	}
};

multiset<node> s[110];
multiset<node>::iterator t;

void planA(){
	for(int i=hd;i>ls;i--){
		s[hd].insert(node(i-1,1));
		cnt[hd]+=1;
	}return;
}

void partB(int now){
	
	if(now>ls){
		return;
	}
	
	if(now==ls){
		if(bs[ls]==0){
			s[top].insert(node(0,0));
			cnt[top]+=1;
		}s[top].insert(node(0,1));
		cnt[top]+=1;
		return;
	}
	
	if(bs[now]==0){
		s[top].insert(node(ls-now,1));
		s[top].insert(node(top+1,0));
		cnt[top]+=2;
	}else{
		s[top].insert(node(top+1,1));
		cnt[top]+=1;
	}
	
	top+=1;
	partB(now+1);
	
	return;
}

void partC(int now){
	
	if(now>ld){
		return;
	}
	
	if(now==ld){
		if(bd[ld]==1){
			s[top].insert(node(0,1));
			cnt[top]+=1;
		}s[top].insert(node(0,0));
		cnt[top]+=1;
		return;
	}
	
	if(bd[now]==1){
		s[top].insert(node(ld-now,0));
		s[top].insert(node(top+1,1));
		cnt[top]+=2;
	}else{
		s[top].insert(node(top+1,0));
		cnt[top]+=1;
	}
	
	top+=1;
	partC(now+1);
	
	return;
}

int main(){
	
	scanf("%d%d",&st,&ed);
	
	if(st==ed){
		for(;st!=0;){
			ls+=1;
			bs[ls]=st%2;
			st/=2;
		}st=ed;
		
		printf("%d\n",ls+1);
		printf("0\n");
		for(int i=1;i<=ls;i++){
			printf("1 %d %d\n",i,st%2);
			st/=2;
		}return 0;
		
	}
	
	for(;st!=0;){
		ls+=1;
		bs[ls]=st%2;
		st/=2;
	}for(;ed!=0;){
		ld+=1;
		bd[ld]=ed%2;
		ed/=2;
	}for(int i=1;i<=ls/2;i++){
		swap(bs[i],bs[ls-i+1]);
	}for(int i=1;i<=ld/2;i++){
		swap(bd[i],bd[ld-i+1]);
	}
	
	if(ls==ld){
		int jd=0;
		for(int i=1;i<=ls;i++){
			if(jd==1){
				if(bs[i]==0){
					aim=max(ls-i,aim);
				}if(bd[i]==1){
					aim=max(ld-i,aim);
				}
			}if(bs[i]!=bd[i]&&jd==0){
				jd=1;
				st1=i;
				st2=i;
			}
		}
	}else{
		st1=1;
		st2=1;
	}
	
	if(ls+1==ld){
		for(int i=1;i<=ls;i++){
			if(bs[i]==0){
				aim=max(aim,ls-i);
			}
		}for(int i=2;i<=ld;i++){
			if(bd[i]==1){
				aim=max(aim,ld-i);
			}
		}
	}if(ls+1<ld){
		aim=ld-2;
	}
	
	for(int i=aim;i>0;i--){
		s[i].insert(node(i-1,1));
		s[i].insert(node(i-1,0));
		cnt[i]+=2;
	}
	
	top=aim+1;
	if(ls==ld){
		for(int i=1;i>0;i++){
			if(bs[i]!=bd[i]){
				break;
			}s[top].insert(node(top+1,bs[i]));
			cnt[top]+=1;
			top+=1;
		}
	}
	
	hd=top;
	planA();
	
	if(st1!=ls){
		top+=1;
		s[hd].insert(node(top,bs[st1]));
		cnt[hd]+=1;
		partB(st1+1);
	}else{
		s[hd].insert(node(0,bs[st1]));
		cnt[hd]+=1;
	}
	
	if(st2!=ld){
		top+=1;
		s[hd].insert(node(top,bd[st2]));
		cnt[hd]+=1;
		partC(st2+1);
	}else{
		s[hd].insert(node(0,bd[st2]));
		cnt[hd]+=1;
	}
	
	printf("%d\n",top+1);
	for(int i=0;i<=top;i++){
		printf("%d",cnt[i]);
		t=s[i].begin();
		for(;t!=s[i].end();t++){
			printf(" %d %d",(*t).to+1,(*t).val);
		}printf("\n");
	}
	
	return 0;
}