#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,M,Q;

struct Edge {
    int src, to, w;
    Edge(int u, int v, int w): src(u), to(v), w(w) {};
};

vector< vector<Edge> > E(111111);

void add_edge(int u, int v, int w) {
    E[u].push_back(*new Edge(u,v,w));
    E[v].push_back(*new Edge(v,u,w));
}
/**********************************************************/

int ans[100001];

void solve() {
    cin>>N>>M;
    
    int a,b;
    REP(i,M) {
        cin>>a>>b;
        add_edge(a, b, 0);
    }
    
    priority_queue<int> que;
    REP(i,N) que.push(i);
    while(!que.empty()) {
        int p = que.top();
        que.pop();
        if (ans[p]) continue;
        for (auto e:E[p]) {
            ans[e.to]=1;
            for (auto it = E[e.to].begin(); it != E[e.to].end(); it++) {
                if (it->to == p) {
                    E[e.to].erase(it);
                    break;
                }
            }
        }
    }
    
    string s;
    RREP(i,N) {
        if (ans[i]) s += '1';
        else if (s.size()) s += '0';
    }
    
    cout << s << endl;
}