1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
#include <cstdio>
#include <queue>
#include <stack>
#include <cstring>
#include <algorithm>
using namespace std;

int a,b,c;
int vis[102][102];

struct p {
    int x;
    int y;
    int cnt;
    int pre[102];
};

void check(int x) {
    if(x == 11)
        printf("DROP(1)\n");
    else if(x == 12)
        printf("DROP(2)\n");
    else if(x == 21)
        printf("FILL(1)\n");
    else if(x == 22)
        printf("FILL(2)\n");
    else if(x == 32)
        printf("POUR(1,2)\n");
    else if(x == 31)
        printf("POUR(2,1)\n");
}

queue<p>q;

int dfs() {
    p p1;
    p1.x = 0;
    p1.y = 0;
    p1.cnt = 0;
    q.push(p1);
    while(!q.empty()) {
        p pp = q.front();
        q.pop();
//        printf("%d %d %d\n",pp.x,pp.y,pp.cnt);
        if(pp.x == c || pp.y == c) {
            printf("%d\n",pp.cnt);
            for(int i = 0 ; i <= pp.cnt ; i++) {
                check(pp.pre[i]);
            }
            while(!q.empty()){
                q.pop();
            }
            return 1;
        }
        p pz = pp;
        pz.cnt = pp.cnt + 1;

//        printf("<%d>\n",pz.cnt);
        ///DROP(1)
        pz.x = 0;
        pz.y = pp.y;
        pz.pre[pz.cnt] = 11;
        if(vis[pz.x][pz.y] == 0) {
            q.push(pz);
            vis[pz.x][pz.y] = 1;
        }
        ///DROP(2)
//        pz = pp;
        pz.x = pp.x;
        pz.y = 0;
        pz.pre[pz.cnt] = 12;
        if(vis[pz.x][pz.y] == 0) {
            q.push(pz);
            vis[pz.x][pz.y] = 1;
        }

        ///FILL(1)
//        pz = pp;
        pz.x = a;
        pz.y = pp.y;
        pz.pre[pz.cnt] = 21;
        if(vis[pz.x][pz.y] == 0) {
            q.push(pz);
            vis[pz.x][pz.y] = 1;
        }

        ///FILL(2)
//        pz = pp;
        pz.x = pp.x;
        pz.y = b;
        pz.pre[pz.cnt] = 22;
        if(vis[pz.x][pz.y] == 0) {
            q.push(pz);
            vis[pz.x][pz.y] = 1;
        }
        ///POUR(2,1)

//        pz = pp;
        pz.pre[pz.cnt] = 31;
        if(pp.y >= a-pp.x) {
            pz.x = a;
            pz.y = pp.y - (a-pp.x);
            if(vis[pz.x][pz.y] == 0) {
                vis[pz.x][pz.y] = 1;
                q.push(pz);
            }
        } else {
            pz.x = pp.x + pp.y;
            pz.y = 0;
            if(vis[pz.x][pz.y] == 0) {
                vis[pz.x][pz.y] = 1;
                q.push(pz);
            }
        }
        ///POUR(1,2)
//        pz = pp;
        pz.pre[pz.cnt] = 32;
        if(pp.x >= b - pp.y) {
            pz.x = pp.x - (b - pp.y);
            pz.y = b;
            if(vis[pz.x][pz.y] == 0) {
                vis[pz.x][pz.y] = 1;
                q.push(pz);
            }
        } else {
            pz.x = 0;
            pz.y = pp.y + pp.x;
            if(vis[pz.x][pz.y] == 0) {
                vis[pz.x][pz.y] = 1;
                q.push(pz);
            }
        }
    }
    return 0;
}

int main() {
    scanf("%d %d %d",&a,&b,&c);
    if(dfs())
        ;
    else{
        printf("impossible\n");
    }
}

/*
6
FILL(2)
POUR(2,1)
DROP(1)
POUR(2,1)
FILL(2)
POUR(2,1)
*/