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
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL;
const ll M = 1000LL * 1000LL * 1000LL + 7LL;
const int N = 1<<24;
int il[N], ans[N];

void Solve()
{
    int n, m, a, b;
    cin >> n >> m;
    for(int i = 1; i < (1<<n); ++i) il[i] = 1;
    for(int j = 1; j <= m; ++j)
    {
        cin >> a >> b; 
        --a; --b;
        for(int i = 1; i < (1<<n); ++i)
            if(((1<<a) & i) && !((1<<b) & i))
            {
                il[i ^ (1<<a) ^ (1<<b)] += il[i];
                il[i] = 0;
            }
    }
    for(int i = 1; i <= n; ++i)
    {
        int cur = 0;
        for(int j = i - 1; j < n; ++j)
        {
            cur ^= (1<<j);
            ans[j - i + 2] += il[cur];
        }
    }
    for(int i = 1; i <= n; ++i)
        cout << ans[i] % 2 << " ";
    cout << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //int t; cin >> t;
    //while(t--)
        Solve();

    return 0;
}