#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

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 RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
template<typename T> inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}
template<typename T> inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

const int MAX = 1e5 + 10;
int n, m;
VI graph[MAX];
string ans = string(MAX, '0');
bool vis[MAX];
set<PII> edge;
map<PII, set<int>> mp;

int main(void) {
    memset(vis, false, sizeof(vis));
    scanf("%d%d", &n, &m);
    REP(i, m) {
        int a, b;
        scanf("%d%d", &a, &b);
        if (a > b) swap(a, b);
        edge.insert(MP(a, b));
        graph[a].EB(b);
        graph[b].EB(a);
    }
    int high = n - 1, low = 0;
    while (high - low > 1) {
        int mid = (high + low) / 2;
        auto cp = edge;
        REP(i, mid) {
            FORE(e, graph[i]) cp.erase(MP(min(i, e), max(i, e)));
        }
        if (cp.size() == 0) high = mid;
        else low = mid;
    }
    
    REP(i, low + 1) {
        FORE(e, graph[i]) mp[MP(min(i, e), max(i, e))].insert(i);
    }
    
    ans[low] = '1';
    memset(vis, false, sizeof(vis));
    vis[low] = true;
    bool F = false;
    RREP(i, low) {
        bool f = false;
        FORE(e, graph[i]) {
            f |= (e > i && !vis[e]);
            //if (i == 7) {DEBUG(e)DEBUG(vis[e])}
        }
        if (!f) continue;
        ans[i] = '1';
        vis[i] = true;
    }
    while (ans.back() == '0') ans.pop_back();
    REVERSE(ans);
    cout << ans << endl;
}