#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M;
vector<int> G[101010];
int C[101010];
const ll mo=1000000007;
ll ret[101010];

ll modpow(ll a, ll n = mo-2) {
	ll r=1;a%=mo;
	while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1;
	return r;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	FOR(i,N) G[i].push_back(i), C[i]=i, ret[i]=1;
	FOR(i,M) {
		cin>>x>>y;
		x=C[x-1];
		y=C[y-1];
		if(x==y) continue;
		
		if(G[x].size()==G[y].size()) {
			FORR(v,G[y]) {
				G[x].push_back(v);
				C[v]=x;
			}
			FORR(v,G[x]) ret[v]=ret[v]*(mo+1)/2%mo;
		}
		else {
			if(G[x].size()<G[y].size()) swap(x,y);
			FORR(v,G[y]) {
				G[x].push_back(v);
				C[v]=x;
				ret[v]=0;
			}
		}
	}
	FOR(i,N) cout<<ret[i]<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}