#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
  
#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
  
using namespace std;
  
typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;
  
const int INF=1<<29;
const double EPS=1e-9;
  
const int dx[]={1,0,-1,0,1,1,-1,-1},dy[]={0,-1,0,1,1,-1,-1,1};

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
typedef __gnu_pbds::tree<int, __gnu_pbds::null_type, less<int>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update> Tree;

int flags[100000] = {0};

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int> > E(n, vector<int>());

    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        E[a].push_back(b);
        E[b].push_back(a);
    }
    string ans = "";
    for(int i = n - 1; i >= 0; i--) {
        bool flag = false;
        for (int j = 0; j < E[i].size(); j++) {
            if (E[i][j] > i && !flags[E[i][j]]) {
                flag = true;
                break;
            }
        }
        if (flag) {
            flags[i] = 1;
            ans += "1";
        } else {
            ans += "0";
        }
    }
    for (int i = 0; i < ans.size(); i++) {
        if (ans[i] == '1') {
            cout << ans.substr(i) << endl;
            break;
        }
    }


    return 0;
}