#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;  
}

#define fr first
#define sc second
#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

#define N 100007

vector<int> e[N];

vector<int> s, ss;

bool vis[N], cir[N];

bool dfs(int u) {
    vis[u] = true; s.eb(u);
    for (auto v : e[u]) {
        if (v == 1 && s.size() > 2) return true;
        if (!vis[v]) if (dfs(v)) return true;
    }
    s.pop_back(); return false;
}

int efs(int u) {
    vis[u] = true; ss.eb(u);
    for (auto v : e[u]) {
        if (cir[v]) return v;
        if (!vis[v]) {
            int ret = efs(v);
            if (ret) return ret;
        } 
    }
    ss.pop_back();
    return 0;
}

int main(){
    int n = rd(), m = rd();
    map<pii, int> id;
    vector<int> keya, keyb;
    rep(i, 0, m - 1) {
        int u = rd(), v = rd();
        e[u].eb(v); e[v].eb(u); 
        id[{u, v}] = id[{v, u}] = i;
    }
    if (!dfs(1)) {puts("No solution"); return 0;}
    memset(vis, 0, sizeof(vis));
    for (auto v : s) cir[v] = true;
    if (cir[0]) {
        int pos = 0;
        int l = s.size();
        rep(i, 1, l - 1) if (s[i] == 0) pos = i;
        rep(i, 1, pos) keya.eb(id[{s[i], s[i - 1]}]);
        rep(i, pos + 1, l - 1) keyb.eb(id[{s[i], s[i - 1]}]);
        keyb.eb(id[{1, s.back()}]);

        sort(all(keya)); sort(all(keyb));
        for (auto x : keya) printf("%d ", x); puts("");
        for (auto x : keyb) printf("%d ", x); puts("");

        per(i, pos - 1, 0) printf("MOVE %d\n", s[i]); 
        puts("DONE");
        per(i, l - 1, pos) printf("MOVE %d\n", s[i]);
        puts("DONE"); return 0;
    }
    int sp = efs(0);
    memset(vis, 0, sizeof(vis));
    if (sp == 1) {
        /* 
        A : 0 -> (ss) -> 1 -> s.back() -> 1
        B : 1 -> (s) -> s.back() -> (s) -> 1 -> (ss) -> 0   
        */
        auto adda = [&](int u, int v) {
            int nw = id[{u, v}];
            keya.eb(nw); vis[nw] = true;
        };
        int l1 = ss.size();
        rep(i, 1, l1 - 1) adda(ss[i], ss[i - 1]);
        adda(ss.back(), 1); adda(1, s.back());
        int notdrop = id[{1, s.back()}];
        rep(i, 0, m - 1) if (!vis[i]) keyb.eb(i);
        
        sort(all(keya)); sort(all(keyb));
        for (auto x : keya) printf("%d ", x); puts("");
        for (auto x : keyb) printf("%d ", x); puts("");
        
        rep(i, 1, l1 - 1) printf("MOVE %d\n", ss[i]);
        printf("MOVE 1\n");
        printf("MOVE %d\n", s.back());
        printf("DROP"); for (auto x : keya) if (x != notdrop) printf(" %d", x); puts("");
        printf("MOVE 1\n");
        puts("DONE");
        
        int l2 = s.size();
        rep(i, 1, l2 - 1) printf("MOVE %d\n", s[i]);
        printf("GRAB\n");
        per(i, l2 - 2, 0) printf("MOVE %d\n", s[i]);
        per(i, l1 - 1, 0) printf("MOVE %d\n", ss[i]);
        puts("DONE");
    } else {
        /* 
        A : 0 -> (ss) -> sp -> ... -> 1
        B : 1 -> (reverse_s) -> sp -> (ss) -> 0 
        */
        vector<int> dropa;
        auto adda = [&](int u, int v, bool drop) {
            int nw = id[{u, v}];
            keya.eb(nw); vis[nw] = true;
            if (drop) dropa.eb(nw);
        };
        int l1 = ss.size(), l2 = s.size();
        rep(i, 1, l1 - 1) adda(ss[i], ss[i - 1], true);
        adda(ss.back(), sp, true); 
        int pos = 0;
        rep(i, 1, l2 - 1) {
            adda(s[i - 1], s[i], false);
            if (s[i] == sp) {pos = i; break;}
        }
        
        rep(i, 0, m - 1) if (!vis[i]) keyb.eb(i);
        
        sort(all(keya)); sort(all(keyb));
        for (auto x : keya) printf("%d ", x); puts("");
        for (auto x : keyb) printf("%d ", x); puts("");
        
        rep(i, 1, l1 - 1) printf("MOVE %d\n", ss[i]);
        printf("MOVE %d\n", sp);
        printf("DROP"); for (auto x : dropa) printf(" %d", x); puts("");
        per(i, pos - 1, 0) printf("MOVE %d\n", s[i]);
        puts("DONE");
        
        per(i, l2 - 1, pos) printf("MOVE %d\n", s[i]);
        printf("GRAB\n");
        per(i, l1 - 1, 0) printf("MOVE %d\n", ss[i]);
        puts("DONE");
    }
    return 0;
}