#include <bits/stdc++.h>
using namespace std;
// Pura Gente del Coach Moy y de la Alexbriza

void dfs(int u, vector<vector<pair<int, int>>>& g, vector<pair<int, int>>& p, vector<bool>& inPath, vector<bool>& vis) {
  if (!u) {
    inPath[u] = true;
  }
  vis[u] = true;
  for (auto [v, i] : g[u]) {
    if (!vis[v]) {
      p[v] = make_pair(u, i);
      dfs(v, g, p, inPath, vis);
      if (inPath[v]) {
        inPath[u] = true;
      }
    }
  }
}

void calc(vector<vector<pair<int, int>>>& g, vector<pair<int, int>>& p, vector<bool>& inPath) {
  vector<bool> vis(int(g.size()));
  dfs(1, g, p, inPath, vis);
}

vector<int> keysUpTo(int u, int v, vector<pair<int, int>>& p) {
  vector<int> ret;
  while (u != v) {
    ret.push_back(p[u].second);
    u = p[u].first;
  }
  return ret;
}

vector<string> pathUpTo(int u, int v, vector<pair<int, int>>& p) {
  vector<string> ret;
  while (u != v) {
    ret.push_back("MOVE " + to_string(p[u].first));
    u = p[u].first;
  }
  return ret;
}

vector<string> pathDownTo(int u, int v, vector<pair<int, int>>& p) {
  swap(u, v);
  vector<string> ret;
  while (u != v) {
    ret.push_back("MOVE " + to_string(u));
    u = p[u].first;
  }
  reverse(ret.begin(), ret.end());
  return ret;
}

string listedKeysUpTo(int u, int v, vector<pair<int, int>>& p) {
  string ret = "";
  while (u != v) {
    if (!ret.empty()) {
      ret += " ";
    }
    ret += to_string(p[u].second);
    u = p[u].first;
  }
  return ret;
}

template <typename T>
void add(vector<T>& a, vector<T> b) {
  for (T& x : b) {
    a.push_back(x);
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);

  int n, m;
  cin >> n >> m;

  vector<vector<pair<int, int>>> g(n);
  for (int i = 0; i < m; ++i) {
    int u, v;
    cin >> u >> v;
    g[u].emplace_back(v, i);
    g[v].emplace_back(u, i);
  }

  vector<pair<int, int>> p(n);
  vector<bool> inPath(n);
  calc(g, p, inPath);

  pair<int, int> backEdge = {-1, -1};
  for (auto [v, i] : g[1]) {
    if (p[v].first != 1) {
      backEdge = make_pair(v, i);
      break;
    }
  }

  if (backEdge.first == -1) {
    cout << "No solution\n";
    return 0;
  }

  int lca = backEdge.first;
  while (lca != 1 && !inPath[lca]) {
    lca = p[lca].first;
  }

  vector<int> ak, bk;
  vector<string> moves;
  ak = keysUpTo(0, 1, p);
  bk.push_back(backEdge.second);
  if (!lca) {
    add(bk, keysUpTo(backEdge.first, 0, p));

    moves = pathUpTo(0, 1, p);
    moves.push_back("DONE");

    moves.push_back("MOVE " + to_string(backEdge.first));
    add(moves, pathUpTo(backEdge.first, 0, p));
    moves.push_back("DONE");
  } else if (lca != 1 && inPath[lca]) {
    add(bk, keysUpTo(backEdge.first, lca, p));

    moves = pathUpTo(0, lca, p);
    moves.push_back("DROP " + listedKeysUpTo(0, lca, p));
    add(moves, pathUpTo(lca, 1, p));
    moves.push_back("DONE");

    moves.push_back("MOVE " + to_string(backEdge.first));
    add(moves, pathUpTo(backEdge.first, lca, p));
    moves.push_back("GRAB");
    add(moves, pathDownTo(lca, 0, p));
    moves.push_back("DONE");
  } else {
    add(ak, keysUpTo(backEdge.first, 1, p));
    
    add(moves, pathUpTo(0, 1, p));
    add(moves, pathDownTo(1, backEdge.first, p));
    moves.push_back("DROP " + listedKeysUpTo(0, 1, p));
    add(moves, pathUpTo(backEdge.first, 1, p));
    moves.push_back("DONE");

    moves.push_back("MOVE " + to_string(backEdge.first));
    moves.push_back("GRAB");
    moves.push_back("MOVE 1");
    add(moves, pathDownTo(1, 0, p));
    moves.push_back("DONE");
  }

  for (int x : ak) {
    cout << x << ' ';
  }
  cout << '\n';
  for (int x : bk) {
    cout << x << ' ';
  }
  cout << '\n';
  for (auto x : moves) {
    cout << x << '\n';
  }
}