#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
 
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
 
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main() {
    int n, m;
    cin >> n >> m;
    VI ans(n);
    vector<P> e(m);
    REP(i,m){
        int x, y;
        cin >> x >> y;
        e[i].first = min(x,y);
        e[i].second = max(x,y);
    }
    sort(ALL(e));
    FORR(i,m-1,0){
        if (ans[e[i].first] || ans[e[i].second]) continue;
        ans[e[i].first] = 1;
    }

    bool f = 0;
    FORR(i,n-1,0){
        if (f) cout << ans[i];
        else{
            if (ans[i]){
                cout << ans[i];
                f = 1;
            }
        }
    }
    return 0;
}