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

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