#include <iostream>
using namespace std;

int n,m; //n-broj cvorova, m-broj grana
int time1=0;
bool connected[6000][6000];
struct cvor
{
    cvor() : visited(false), disctime1(-1), endtime1(-1), low(-1) {}
    bool visited;
    int disctime1; //vreme pronalaska
    int endtime1; //vreme zavrsetka sa ovim cvorom
    int low; //najvise sto mozemo da odemo
};
cvor niz[5000];

void dfs(int a)
{
    if(niz[a].visited==false)
    {
        bool art=true;
        cvor &t=niz[a];
        t.visited=true;
        t.low=t.disctime1=++time1;

        for(int i=0;i<n && connected[a][i] && !niz[i].visited;i++)
        {
            art=false;
            bool most=true;
            dfs(i);
            if(niz[i].low>=t.disctime1)
            {
                t.low=niz[i].low;
                most=false;
            }else
            {
                art=true;
            }
            if(most)
                cout << endl << "Most: " << a << "-" << i;
        }
        if(art)
            cout << endl << "Artikulacioni cvor: " << a;
        t.endtime1=++time1;
        }
}

int main() {
    for(int i=0;i<5005;i++)
        for(int j=0;j<5005;j++)
            connected[i][j]=false;

    cin >> n >> m;

    for(int i=0;i<m;i++)
    {
        int a,b;
        cin >> a >> b;
        connected[a][b]=connected[b][a]=true;
    }
    return 0;
}