1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; cin>>_tests; FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;
#define SIZE(coll) 					((int)coll.size())

#define M 1000000007
#define INF 1000000007LL

using namespace std;

long long n, m, a, b;
long long res[107];
vector <pair<long long, long long>> ruchy;
/*
pair <int, int> symuluj10(int a, int b)
{
    for(auto p : ruchy)
    {
        if(a == p.ff)
            a = p.ss;
        if(b == p.ss)
            b = p.ff;
    }
    return {a, b};
}

void symuluj_old()
{
    FOR(i, 1, n)
        FOR(j, i+1, n)
        {
            auto p1 = symuluj10(i, j);
            auto p2 = symuluj10(j, i);
            //cout << "symulacja " << i << " " << j << " dala " << p1.ff << " " << p1.ss << '\n';
            //cout << "symulacja " << j << " " << i << " dala " << p2.ff << " " << p2.ss << '\n';
            if(p1 == p2)
                cout << "laczy " << i << " i " << j << '\n';
        }
}
*/
void generuj(long long maska)
{
    vector <long long> maski, poprz;
    maski.PB(maska);
    //printf("%036lb\n", maska);
    FORD(i, m-1, 0)
    {
        long long pa = ruchy[i].ff;
        long long pb = ruchy[i].ss;
        swap(poprz, maski);
        maski.clear();
        for(auto mask : poprz)
        {
            a = (mask >> pa) & 1;
            b = (mask >> pb) & 1;
            if(b == 1 && a == 0)
            {
                maski.PB(mask);
                maski.PB(mask - (1LL<<pb) + (1LL<<pa));
            }
            else if(a == b)
            {
                maski.PB(mask);
            }
        }
    }
    for(auto mask : maski)
        res[__builtin_popcountll(mask)]++;
}

int solve()
{
    cin >> n >> m;
    forr(i, m)
    {
        cin >> a >> b;
        ruchy.PB({a, b});
    }

    FOR(i, 1, n)
        FOR(j, i, n)
        {
            long long maska = 0;
            FOR(k, i, j)
                maska |= (1LL<<(long long)k);
            generuj(maska);
        }

    FOR(i, 1, n)
        cout << res[i]%2 << " ";
    cout << '\n';

    return 0;
}

int main()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();

    return 0;
}