#include<bits/stdc++.h>
using namespace std;
int a,b,f,t=1,h=0;
struct node{
	int step;
	int na;
	int nb;
	int u;
	int fa;
}q[100005];
void print(int x){
	if(x==-1)
	{
		cout<<q[h].step<<' ';
		return;
	}
	print(q[x].fa);
	cout<<q[x].u<<' ';
}
int v1[10005],v2[10005];
int main()
{
	cin>>a>>b>>f;
	q[1].step=0;
	q[1].na=0;
	q[1].nb=0;
	q[1].fa=-1;
	while(h<t)
	{
		h++;
		if(v1[q[h].na]&&v2[q[h].nb])continue;
		cout<<q[h].step<<' '<<q[h].na<<' '<<q[h].nb<<' '<<q[h].u<<' '<<q[h].fa<<'\n';
		if(q[h].na==f||q[h].nb==f)
		{
			print(h);
			cout<<<'\n';
			break;
		}
		if(q[h].na!=a){//1
			t++;
			q[t].step=q[h].step+1;
			q[t].na=a;
			q[t].nb=q[h].nb;
			q[t].u=1;
			q[t].fa=h;	
			v1[q[t].na]=1;
		v2[q[t].nb]=1;
		}
		if(q[h].nb!=b){//2
			t++;
			q[t].step=q[h].step+1;
			q[t].na=q[h].na;
			q[t].nb=b;
			q[t].u=2;
			q[t].fa=h;	
			v1[q[t].na]=1;
		v2[q[t].nb]=1;
		}
		if(q[h].na&&q[h].nb){//3
			t++;
			q[t].step=q[h].step+1;
			q[t].na=0;
			q[t].nb=q[h].nb;
			q[t].u=3;
			q[t].fa=h;	
			v1[q[t].na]=1;
		v2[q[t].nb]=1;		
		}
		if(q[h].na&&q[h].nb){//4		
			t++;
			q[t].step=q[h].step+1;
			q[t].na=q[h].na;
			q[t].nb=0;
			q[t].u=4;
			q[t].fa=h;
			v1[q[t].na]=1;
		v2[q[t].nb]=1;
		}
		if(q[h].na&&q[h].nb!=b){//5	
			int dao=min(q[h].na+q[h].nb,b)-q[h].nb;	
			t++;
			q[t].step=q[h].step+1;
			q[t].na=q[h].na-dao;
			q[t].nb=q[h].nb+dao;
			q[t].u=5;
			q[t].fa=h;
			v1[q[t].na]=1;
		v2[q[t].nb]=1;
		}
		if(q[h].na&&q[h].nb!=b){//6
			int dao=min(q[h].na+q[h].nb,a)-q[h].na;	
			t++;
			q[t].step=q[h].step+1;
			q[t].na=q[h].na+dao;
			q[t].nb=q[h].nb-dao;
			q[t].u=6;
			q[t].fa=h;
			v1[q[t].na]=1;
		v2[q[t].nb]=1;
		}
	}
	cout<<-1;
}