#include<bits/stdc++.h>
using namespace std;
int n,m;
int fx[2]={1,0},fy[2]={0,1},bx[25],by[25],ans=1;
void dfs(int x,int y,int st){
	bx[st]=x;by[st]=y;
	if(x==n&&y==m){
		cout<<ans<<":";
		ans+=1;
		for(int i=1;i<=st;i++){
			cout<<bx[i]<<","<<by[i];
			if(i!=st) cout<<"->";
		}
		cout<<endl;
		return;
	}
	for(int i=0;i<2;i++){
		int tx=x+fx[i],ty=y+fy[i];
		if(tx>=1&&tx<=n&&ty>=1&&ty<=m){
			dfs(tx,ty,st+1);
		}
	}
}
int main(){
	cin>>n>>m;
	dfs(1,1,1);
return 0;}

/**************************************************************
	Problem: 1360
	User: fzy001
	Language: C++
	Result: Accepted
	Time:9 ms
	Memory:2072 kb
****************************************************************/