import java.util.Scanner;
import java.util.Stack;


public class WaterPouring2012_10 {

	/**
	 * @param args
	 */
	public static int A,B,C;//三个杯子的容量
	public static Stack<Integer[]> road=new Stack<Integer[]>();//记录倒水步骤
	public static boolean[][][] vis;
	public static int num=0;//记录解的数量
	public static int aim;//目标水量
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc=new Scanner(System.in);
		A=sc.nextInt();
		B=sc.nextInt();
		C=sc.nextInt();
		
		vis=new boolean[2*A][2*A][2*A];
		for(int i=0;i<A*2;i++)
			for(int j=0;j<A*2;j++)
				for(int k=0;k<A*2;k++)
					vis[i][j][k]=false;
			
		int Astart=sc.nextInt();
		int Bstart=sc.nextInt();
		int Cstart=sc.nextInt();
		
		aim=sc.nextInt();
		
		road.push(new Integer[]{Astart,Bstart,Cstart});
		//vis[A][0][0]=true;
		//PrintRoad();
		Pouring(Astart,Bstart,Cstart);
		if(num==0)
		{
			System.out.println("不可能");
		}
	}
	
	public static void Pouring(int x,int y,int z)
	{
		//System.out.println(x+" "+y+" "+z+"qqq"+road.size());
		if(x==aim||y==aim||z==aim)
		{
			num++;
			System.out.println("num:"+num);
			PrintRoad();	
		}
		else if(x<=A&&y<=B&&z<=C&&!vis[x][y][z])//如果没访问过
		{
			vis[x][y][z]=true;//该节点的所有子结点全部被访问
			//A->B A倒空
			if((B-y)>=x&&x>0)
			{
				//System.out.print("A->B A倒空");
				road.push(new Integer[]{0, x+y, z});
				Pouring(0, x+y, z);
				road.pop();
			}
			//A->B B倒满
			if(y<B&&x>0&&(x+y)>=B)
			{
				//System.out.print("A->B B倒满");
				road.push(new Integer[]{x+y-B, B, z});
				Pouring(x+y-B, B, z);
				road.pop();
			}
			//A->C A倒空
			if((C-z)>=x&&x>0)
			{
				//System.out.print("A->C A倒空");
				road.push(new Integer[]{0,y,x+z});
				Pouring(0,y,x+z);
				road.pop();
			}
			//A->C C倒满
			if(z<C&&x>0&&(x+z)>=C)
			{
				//System.out.print("A->C C倒满");
				road.push(new Integer[]{x+z-C,y,C});
				Pouring(x+z-C,y,C);
				road.pop();
			}
			
			//B->A B倒空
			if((A-x)>=y&&y>0)
			{
				//System.out.print("B->A B倒空");
				road.push(new Integer[]{x+y,0,z});
				Pouring(x+y,0,z);
				road.pop();
			}
			//B->A A倒满
			if(x<A&&y>0&&(y+x)>=A)
			{
				//System.out.print("B->A A倒满");
				road.push(new Integer[]{A,x+y-A,z});
				Pouring(A,x+y-A,z);
				road.pop();
			}
			//B->C B倒空
			if((C-z)>y&&y>0)
			{
				//System.out.print("B->C B倒空");
				road.push(new Integer[]{x,0,y+z});
				Pouring(x,0,y+z);
				road.pop();
			}
			//B->C C倒满
			if(z<C&&y>0&&(y+z)>=C)
			{
				//System.out.print("B->C C倒满");
				road.push(new Integer[]{x,y+z-C,C});
				Pouring(x,y+z-C,C);
				road.pop();
			}
			
			//C->A C倒空
			if((A-x)>z&&z>0)
			{
				//System.out.print("C->A C倒空");
				road.push(new Integer[]{x+z,y,0});
				Pouring(x+z,y,0);
				road.pop();
			}
			//C->A A倒满
			if(x<A&&z>0&&(x+z)>=A)
			{
				//System.out.print("C->A A倒满");
				road.push(new Integer[]{A,y,x+z-A});
				Pouring(A,y,x+z-A);
				road.pop();
			}
			//C->B C倒空
			if((B-y)>z&&z>0)
			{
				//System.out.print("C->B C倒空");
				road.push(new Integer[]{x,y+z,0});
				Pouring(x,y+z,0);
				road.pop();
			}
			//C->B B倒满
			if(y<B&&z>0&&(y+z>=B))
			{
				//System.out.print("C->B B倒满");
				road.push(new Integer[]{x,B,y+z-B});
				Pouring(x,B,y+z-B);
				road.pop();
			}
				
		}
	}
	
	public static void PrintRoad()
	{
		for(int i=0;i<road.size();i++)
		{
			Integer[] tmp=road.get(i);
			System.out.println("("+tmp[0]+","+tmp[1]+","+tmp[2]+")");
		}
		//road.push(new Integer[]{A,0,0});
	}

}