#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <set>
#include <stack>
#include <cstring>
#include <map>
#include <iomanip>
#include <queue>
using namespace std;


#define mkp(a, b) make_pair(a, b)
#define F first
#define S second
#define MAX(a, b) ((a) > (b) ? (a) : (b))

int n, m;
vector<vector<int > > g;
char state[5000];

void f(int v, int parent=0)
{
    state[v] = 1;
    for(int i = 0; i < g[v].size(); i++)
        if(parent == 0 || g[v][i] != parent)
        {
            if(state[g[v][i]] == 0)
                f(g[v][i], v);
            else if(state[g[v][i]] == 1)


        }
    state[v] = 2;
}

int main() {
//    ios_base::sync_with_stdio(0);
//    freopen("tree.in", "r", stdin);
//    freopen("tree.out", "w", stdout);

    scanf("%d %d", &n, &m);

    memset(state, 0, sizeof state);

    g.resize(n+1);

    for(int i = 0; i < m; i++)
    {
        int a, b;
        g[a].push_back(b);
        g[b].push_back(a);
    }


    return 0;
}