#include "bits/stdc++.h" #define int long long using namespace std; using ll = long long; using P = pair>; const ll INF = (1LL << 61); ll mod = 1000000007; struct mint { ll x; // typedef long long ll; mint(ll x = 0) :x((x%mod + mod) % mod) {} mint operator-() const { return mint(-x); } mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod - a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; } mint operator+(const mint a) const { mint res(*this); return res += a; } mint operator-(const mint a) const { mint res(*this); return res -= a; } mint operator*(const mint a) const { mint res(*this); return res *= a; } mint pow(ll t) const { if (!t) return 1; mint a = pow(t >> 1); a *= a; if (t & 1) a *= *this; return a; } // for prime mod mint inv() const { return pow(mod - 2); } mint& operator/=(const mint a) { return (*this) *= a.inv(); } mint operator/(const mint a) const { mint res(*this); return res /= a; } }; istream& operator>>(istream& is, mint& a) { return is >> a.x; } ostream& operator<<(ostream& os, const mint& a) { return os << a.x; } signed main() { ios::sync_with_stdio(false); cin.tie(0); int N, M; cin >> N >> M; vectorans(N, 1); vector>st(N); vectorroot(N); for (int i = 0; i < N; i++) { st[i].insert(i); root[i] = i; } for (int i = 0; i < M; i++) { int a, b; cin >> a >> b; a--; b--; a = root[a], b = root[b]; int sa = st[a].size(), sb = st[b].size(); if (sa < sb) { swap(a, b); swap(sa, sb); } if (sa == sb) { for (auto x : st[a]) { ans[x] /= 2; } for (auto x : st[b]) { ans[x] /= 2; root[x] = a; st[a].insert(x); } st[b].clear(); } else { for (auto x : st[b]) { ans[x] = 0; root[x] = a; st[a].insert(x); } st[b].clear(); } } for (int i = 0; i < N; i++) { cout << ans[i] << endl; } return 0; }