#include<bits/stdc++.h>
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
	int n,m;
	cin>>n>>m;
	vector<vector<pair<int,int>>> G(n+5);
	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);
	}
	queue<int> q;
	vector<int> pa(n+5),pid(n+5),dep(n+5),typ(n+5);
	pair<int,int> sp={0,0};
	int spid=0;
	typ[1]=1;
	dep[1]=1;
	for(auto [v,id]:G[1])
	{
		q.push(v);
		typ[v]=v;
		pid[v]=id;
		dep[v]=2;
		pa[v]=1;
	}
	while(not q.empty())
	{
		int u=q.front();q.pop();
//		cerr<<"bfs "<<u<<endl;
		for(auto [v,id]:G[u])
		{
			if(not dep[v])
			{
				q.push(v);
				typ[v]=typ[u];
				dep[v]=dep[u]+1;
				pa[v]=u;
				pid[v]=id;
			}
			else if(typ[v]!=typ[u] and dep[v]>=dep[u] and sp==(pair<int,int>){0,0})
			{
				sp={u,v};
				spid=id;
			}
		}
	}
	if(sp==(pair<int,int>){0,0})
	{
		cout<<"No solution"<<endl;
		return 0;
	}
	vector<pair<int,int>> st0,st1,st2;
	vector<int> keys(m+5);
	if(typ[0]==typ[sp.second])swap(sp.second,sp.first);
	auto gao=[&](vector<pair<int,int>> &st, int x,int tar=1)
	{
		vector<pair<int,int>> tmp;
		while(x!=tar)
		{
//			cerr<<"gao "<<x<<endl;
			tmp.emplace_back(x,pid[x]);
			x=pa[x];
		}
		reverse(tmp.begin(),tmp.end());
		for(auto z:tmp)
			st.push_back(z);
	};
//	cerr<<"sp "<<sp.first<<' '<<sp.second<<' '<<spid<<endl;
	gao(st0,0);
	gao(st1,sp.first);
	gao(st2,sp.second);
	if(typ[0]==typ[sp.first])
	{
		int u0=st0.back().first;
		while(u0!=st1.back().first)
		{
			if(dep[u0]>=dep[st1.back().first])
			{
				//go st0
				u0=pa[u0];
			}
			else
			{
				//go st1
				st2.emplace_back(st1.back().first,spid);
				spid=st1.back().second;
				st1.pop_back();
			}
		}
		st0.clear();
		gao(st0,0,u0);
		for(auto [x,id]:st2)keys[id]=1;
		keys[spid]=1;
		for(int i=0;i<m;i++)
			if(keys[i]==0)
				cout<<i<<' ';
		cout<<endl;
		for(int i=0;i<m;i++)
			if(keys[i]==1)
				cout<<i<<' ';
		cout<<endl;
		for(int i=(int)st0.size()-2;i>=0;i--)
		{
			cout<<"MOVE "<<st0[i].first<<"\n";
		}
		if(not st0.empty())
		{
			cout<<"MOVE "<<u0<<"\n";
			cout<<"DROP";
			for(auto [x,id]:st0)
				cout<<' '<<id;
			cout<<"\n";
		}
		for(int i=(int)st1.size()-2;i>=0;i--)
		{
			cout<<"MOVE "<<st1[i].first<<"\n";
		}
		cout<<"MOVE "<<1<<"\n";
		cout<<"DONE\n";
		
		for(int i=0;i<(int)st2.size();i++)
		{
			cout<<"MOVE "<<st2[i].first<<"\n";
		}
		cout<<"MOVE "<<u0<<"\n";
		cout<<"GRAB\n";
		for(int i=0;i<(int)st0.size();i++)
		{
			cout<<"MOVE "<<st0[i].first<<"\n";
		}
		cout<<"DONE\n";
	}
	else
	{
		for(auto [x,id]:st2)keys[id]=1;
		for(int i=0;i<m;i++)
			if(keys[i]==0)
				cout<<i<<' ';
		cout<<endl;
		for(int i=0;i<m;i++)
			if(keys[i]==1)
				cout<<i<<' ';
		cout<<endl;
		for(int i=(int)st0.size()-2;i>=0;i--)
		{
			cout<<"MOVE "<<st0[i].first<<"\n";
		}
		cout<<"MOVE "<<1<<"\n";
		for(int i=0;i<(int)st1.size();i++)
		{
			cout<<"MOVE "<<st1[i].first<<"\n";
		}
		cout<<"MOVE "<<sp.second<<"\n";
		cout<<"DROP";
		for(auto [x,id]:st0)
			cout<<' '<<id;
		cout<<"\n";
		for(int i=(int)st1.size()-1;i>=0;i--)
		{
			cout<<"MOVE "<<st1[i].first<<"\n";
		}
		cout<<"MOVE "<<1<<"\n";
		cout<<"DONE\n";
		
		for(int i=0;i<(int)st2.size();i++)
		{
			cout<<"MOVE "<<st2[i].first<<"\n";
		}
		cout<<"GRAB\n";
		for(int i=(int)st2.size()-2;i>=0;i--)
		{
			cout<<"MOVE "<<st2[i].first<<"\n";
		}
		cout<<"MOVE "<<1<<"\n";
		for(int i=0;i<(int)st0.size();i++)
		{
			cout<<"MOVE "<<st0[i].first<<"\n";
		}
		cout<<"DONE\n";
	}
	
	return 0;
}