#include <iostream>
#include <fstream>

using namespace std;

int a[10][10],n,m,x,y,conex = 1,viz[10], d[10];
ifstream f("gn.txt");

void citire()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x][y]=1;
        a[y][x]=1;
    }
}
void afisare()
{   for(int i=1;i<=n;i++)

    { for(int j=1;j<=n;j++)
     cout<<a[i][j]<<" ";
     cout<<endl;
    }
}
void grad()
{ //int d[10];
for(int i=1;i<=n;i++)
{
    d[i] = 0;
for(int j=1;j<=n;j++)
    d[i]=d[i]+a[i][j];
cout<<"d("<<i<<")="<<d[i]<<endl;
if(d[i] = 0)
    conex = 0;
}

}
void parcurgere_adancime(int nod)
{
    int k;
    cout<<nod<<" ";
    viz[nod]=1;
    for(k=1;k<=n;k++)
        if(a[nod][k]==1&&viz[k]==0)
        parcurgere_adancime(k);
}

int main()
{int ver = 0; ///ver = verificare paritate
    citire();
    afisare();
    cout << endl;
    grad();
    if(conex)
    {
        for(int i=1;i<=n;i++)
            if( d[i]%2 == 0)
               ver = 1;
    }
    if(ver == 1)
        cout << "graful este eulerian";
    else cout <<"Nop";
}