#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<int> v[N];
int n, m;
int x, y;
bool vis[N];
void dfs(int x) {
    for (int i = 0; i < v[x].size(); i++) {
        int y = v[x][i];
        if (!vis[y]) {
            vis[y] = 1;
            dfs(y);
        }
    }
}
int main() {
    cin >> n >> m;
    for (int i = 1; i <= m; i++) { //存图
        cin >> x >> y;
        v[y].push_back(x); //反向建边
    }
    dfs(1); //深搜
    if (v[1].empty())
        vis[1] = 1; //特判
    for (int i = 1; i <= n; i++)
        cout << vis[i]; //输出
    return 0;
}