当A无法被进攻时就只有A有法杖，需特判！！

#include <bits/stdc++.h>
using namespace std;
vector <int> a[100010];
int n,m;
bool vis[100010];
void ss(int wz){
	for (int i = 0 ; i< a[wz].size() ; i++){
		if(!vis[a[wz][i]]){
			vis[a[wz][i]] = 1;
			ss(a[wz][i]);
		}
	}
}
int main (){
	cin >> n >> m;
	for (int i = 1 ; i <= m ; i ++){
		int x,y;
		cin >> x >> y;
		a[y].push_back(x);
	}
	//vis[1] = 1;
	if(a[1].size() == 0){//！！！！
		vis[1] = 1;
	}else{
		ss(1);
	}
	for (int i = 1 ; i <= n ; i ++){
		cout << vis[i] ;
	}
	return 0;
}