#include <cstdio>
#include <vector>
#include <cstdlib>
#include <cstring>

using namespace std;

const int MAXN = 1e5 ;
int n,m;
vector <int> g [MAXN];
bool used[MAXN] ;
int timer, tin[MAXN], low[MAXN];
 
void dfs (int v, int p) {
	used [v] = 1 ;
	tin [v]=low[v]=timer++;
	for (int i = 0 ; i < g[v].size(); i++){
		int to = g[v][i];
		if (to==p)continue;
		if (used[to])
			low[v]=min(low[v],tin[to]);
		else {
			dfs(to,v);
			low[v] = min(low[v],low[to]);
			if (low[to]>tin[v])
				printf("Most med %d in %d\n",v,to);
		}
	}
}
 
void find_bridges(){
	timer = 0 ;
    memset(used,0,sizeof(used));
	for (int i = 1; i<=n; i++)
		if (!used[i])
			dfs(i,-1);
} 

int main(){
    scanf("%d%d",&n,&m);
    for(int i=0;i<m;i++){
        int a,b;
        scanf("%d%d",&a,&b);
        g[a].push_back(b);
        g[b].push_back(a);
    }
    find_bridges();
}