#include <iostream>
#include <algorithm>
#include <vector>
#include <string>

void solve() {
    int n, m;
    std::cin >> n >> m;

    std::vector<std::pair<int, int>> es(m);
    for (auto& [u, v] : es) std::cin >> u >> v;
    std::sort(es.rbegin(), es.rend());

    std::string ans(n, '0');
    for (auto [u, v] : es) {
        if (ans[u] == '0' && ans[v] == '0') ans[u] = '1';
    }

    while (ans.back() == '0') ans.pop_back();
    std::reverse(ans.begin(), ans.end());
    std::cout << ans << "\n";
}

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

    solve();

    return 0;
}