#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main(){
    int n, m;
    cin >> n >> m;
    vector<int> roads[n];
    for(int i = 0; i < m; i++){
        int start, goal;
        cin >> start >> goal;
        roads[start].push_back(goal);
        roads[goal].push_back(start);
    }
    bool if_choose[n];
    fill(if_choose, if_choose + n, false);
    string ans;
    for(int i = n - 1; i >= 0; i--){
        if(!if_choose[i]){
            for(int j = 0; j < roads[i].size(); j++){
                if_choose[roads[i][j]] = true;
            }
            if(ans != ""){
                ans.push_back('0');
            }
        }else{
            ans.push_back('1');
        }
    }
    cout << ans << endl;
}