#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;
fstream fin("meh.txt");

struct nod
{
    int vecini[20], vizitat=0, parinte=0, nivel, low;
};

int numara(int x, int n, nod nod[])
{
    int counter=0;

    for(int i=1; i<=n; i++)
        if(nod[x].vecini[i] == 1 && i != x)
            counter++;

    return counter;

}

void DFS(int x, int n, nod nod[],int nivel)
{
    //cout<<x<<" ";
    int i;

    nod[x].vecini[x]=1;
    nod[x].vizitat=1;

    nod[x].nivel = nod[x].low = ++nivel;

    for(i=1; i <= n; i++)
        if(nod[x].vecini[i] == 1 && !nod[i].vizitat)
        {
            DFS(i,n,nod,nivel);

            //cout<<i<<" ";
            nod[x].low = min(nod[x].low,nod[i-1].low);

            if(nod[i-1].low >= nod[x].nivel || (!nod[x].parinte && numara(x,n,nod) > 1))
                cout<<x<<" e punct de articulatie."<<endl;
        }

}

int main()
{
    nod nod[20];
    int nr_noduri, nr_muchii, x,y,aux;

    fin>>nr_noduri>>nr_muchii;

    aux=nr_muchii;

    while(aux)
    {
        fin>>x>>y;

        nod[x].vecini[y]=nod[y].vecini[x]=1;
        nod[y].parinte=x;
        aux--;
    }

    DFS(1,nr_noduri,nod,0);

    return 0;
}