H

#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <queue>
using namespace std;

const int maxn = 105;

char f[10][10] ={ "FILL(1)","FILL(2)","DROP(1)","DROP(2)","POUR(1,2)","POUR(2,1)"};
int a,b,c;
struct node{
    int fx, fy;
    int step, op;
}v[maxn][maxn];

struct point{
    int x, y;
}s, q;

void dfs(int x, int y){
    if(x == 0 && y == 0){
        return ;
    }
    dfs(v[x][y].fx,v[x][y].fy);

    cout << f[v[x][y].op] << endl;
}

queue<point>p;
void bfs(){
    while(!p.empty()) p.pop();
    s.x = s.y = 0;
    v[0][0].step = 1;

    p.push(s);
    while(!p.empty()){
        s = p.front(); p.pop();

        if(s.x == c || s.y == c){
            cout << v[s.x][s.y].step - 1 << endl;
            dfs(s.x, s.y);
            return ;
        }
        for(int i = 0 ;i < 6;i++){
            q = s;
            if(i == 0){
                q.x = a;
            }
            else if(i == 1){
                q.y = b;
            }
            else if(i == 2){
                q.x = 0;
            }
            else if(i == 3){
                q.y = 0;
            }
            else if(i == 4){
                if(q.x + q.y <= b){
                    q.y += q.x, q.x = 0;
                }
                else
                    q.x -= (b-q.y), q.y = b;
            }
            else if(i == 5){
                 if(q.x+q.y <= a)
                    q.x += q.y, q.y = 0;
                 else
                    q.y -= (a-q.x), q.x = a;
            }

            if(v[q.x][q.y].step == 0){
                v[q.x][q.y].step = v[s.x][s.y].step+1;
                v[q.x][q.y].fx = s.x;
                v[q.x][q.y].fy = s.y;
                v[q.x][q.y].op = i;

                p.push(q);
            }
        }
    }
    cout << "impossible" << endl;
}

int main(){
    cin >> a >> b >> c;
        //memset(v,0,sizeof(v));
        bfs();

    return 0;
}