#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
mint ans[100005];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int N, M;
	cin >> N >> M;
	vector<set<int>>st(N);
	rep(i, N) { st[i].insert(i); }
	rep(i, N) { ans[i] = 1; }
	dsu uf(N);
	rep(i, M) {
		int a, b;
		cin >> a >> b;
		a--; b--;
		int x = uf.leader(a);
		int y = uf.leader(b);
		if (x == y) { continue; }
		if (uf.size(a) > uf.size(b)) {
			for (auto s : st[y]) { ans[s] = 0; }
		}
		else if (uf.size(a) < uf.size(b)) {
			for (auto s : st[x]) { ans[s] = 0; }
		}
		else {
			for (auto s : st[x]) { ans[s] /= 2; }
			for (auto s : st[y]) { ans[s] /= 2; }
		}
		uf.merge(a, b);
		if (x == uf.leader(a)) {
			for (auto s : st[y]) { st[x].insert(s); }
		}
		else {
			for (auto s : st[x]) { st[y].insert(s); }
		}
	}
	rep(i, N) { cout << ans[i].val() << endl; }
	return 0;
}