#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n, m;
    while(cin >> n >> m) {
        vi a(m), b(m), cnt(m, 2);
        vector<vi> g(n);
        rep(i, m) {
            cin >> a[i] >> b[i];
            g[a[i]].push_back(i);
            g[b[i]].push_back(i);
        }

        deque<int> ans;

        int ng = 0;
        for(int i = n - 1; i >= 0; --i) {
            each(e, g[i]) {
                cnt[e]--;
                if(cnt[e] == 0) {
                    ng++;
                }
            }
            if(ng > 0) {
                each(e, g[i]) {
                    cnt[e]++;
                    if(cnt[e] == 1) {
                        ng--;
                    }
                }
                assert(ng == 0);
                ans.push_back(1);
            } else {
                ans.push_back(0);
            }
        }
        while(sz(ans) && ans[0] == 0)ans.pop_front();
        each(x, ans)cout << x;
        cout << endl;
    }
}