#include #define rep(i, a, n) for(int i = a; i < n; i++) #define repb(i, a, b) for(int i = a; i >= b; i--) #define all(a) a.begin(), a.end() #define o(a) cout << a << endl #define int long long using namespace std; typedef pair P; signed main(){ int n, m; cin >> n >> m; vector f(n, false); vector

d; rep(i, 0, m){ int a, b; cin >> a >> b; if(a < b) swap(a, b); d. push_back(P(a, b)); } sort(all(d)); reverse(all(d)); rep(i, 0, d.size()){ if(f[d[i].first] || f[d[i].second]) continue; f[d[i].second] = true; } string s = ""; repb(i, n - 1, 0){ if(s == "" && f[i] == false) continue; else{ if(f[i]) s += "1"; else s += "0"; } } cout << s << endl; }