#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <algorithm>

#define IOS ios::sync_with_stdio(false)

using namespace std;

#define inf (0x3f3f3f3f)

typedef long long int LL;

#include <iostream>

#include <sstream>

#include <vector>

#include <set>

#include <map>

#include <queue>

#include <string>

const int maxn = 2e5 + ;

vector<int>son[maxn];

bool vis[maxn];

void work() {

    IOS;

    int n, m;

    cin >> n >> m;

    for (int i = ; i <= m; ++i) {

        int u, v;

        cin >> u >> v;

        son[u].push_back(v);

        son[v].push_back(u);

    }

    int mi = inf;

    int id = inf;

    for (int i = ; i <= n; ++i) {

        if (son[i].size() < mi) {

            mi = son[i].size();

            id = i;

        }

    }

    vis[id] = ;

    for (int i = ; i < son[id].size(); ++i) {

        vis[son[id][i]] = ;

    }

    for (int i = ; i <= n; ++i) {

        printf("%d ", !vis[i]);

    }

}

int main() {

#ifdef local

    freopen("data.txt","r",stdin);

#endif

    work();

    return ;

}