Pots

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main{
private static Scanner inScanner=new Scanner(System.in);
static List<Nodeo> biao;
static boolean visit[][]=new boolean[105][105];
public static void main(String[] args){
while(inScanner.hasNext()){
int a=inScanner.nextInt();
int b=inScanner.nextInt();
int c=inScanner.nextInt();
for(int i=0;i<105;i++){
for(int j=0;j<105;j++)
visit[i][j]=false;
}
biao=new ArrayList<Nodeo>();
biao.add(new Nodeo(0, 0, "", 0));
visit[0][0]=true;
while(!biao.isEmpty()){
Nodeo node=biao.get(0);
biao.remove(0);
if(node.a==c||node.b==c){
System.out.print(node.pos+"\n"+node.result);
break;
}
int x,y;
//a装满
x=a;y=node.b;
if(!visit[x][y]){
biao.add(new Nodeo(x, y, node.result+"FILL(1)\n", node.pos+1));
visit[x][y]=true;
}
//a倒空
x=0;y=node.b;
if(!visit[x][y]){
biao.add(new Nodeo(x, y, node.result+"DROP(1)\n", node.pos+1));
visit[x][y]=true;
}
//a倒入b中
x=node.a>(b-node.b)?node.a-b+node.b:0;y=b-node.b>node.a?node.a+node.b:b;
if(!visit[x][y]){
biao.add(new Nodeo(x, y, node.result+"POUR(1,2)\n", node.pos+1));
visit[x][y]=true;
}
//b装满
x=node.a;y=b;
if(!visit[x][y]){
biao.add(new Nodeo(x, y, node.result+"FILL(2)\n", node.pos+1));
visit[x][y]=true;
}
//b倒空
x=node.a;y=0;
if(!visit[x][y]){
biao.add(new Nodeo(x, y, node.result+"DROP(2)\n", node.pos+1));
visit[x][y]=true;
}
//b导入a中
y=node.b>(a-node.a)?node.b-a+node.a:0;x=a-node.a>node.b?node.a+node.b:a;
if(!visit[x][y]){
biao.add(new Nodeo(x, y, node.result+"POUR(2,1)\n", node.pos+1));
visit[x][y]=true;
}
if(biao.isEmpty()){
System.out.println("impossible");
break;
}
}
}
}
}
class Nodeo{
int a;
int b;
String result;
int pos;
public Nodeo(int a,int b,String result,int pos){
this.a=a;this.b=b;this.result=result;this.pos=pos;
}
}