#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
ll jyo(ll x,ll y,ll z){
  ll H=y; //ここから
       ll a=1,b=(x%z+z)%z,c=1;
       while(H>0){
         a*=2;
         if(H%a!=0){
           H-=a/2;
           c*=b;
           c%=z;
         }
        b*=b;
         b%=z;
      } //ここまで
 return c;
}


namespace po167{
struct UFtree
{
	std::vector<int> wei;
	std::vector<int> q;
	std::vector<std::vector<int>> G;
	std::vector<ll> ans;
	UFtree(int n):wei(n),G(n),ans(n),par(n){
		for(int i=0;i<n;i++){
			wei[i]=1,par[i]=i,ans[i]=1;
		}
	}

	//根っこを返す
	int root(int a){
		if(a==par[a]) return a;
		return par[a]=root(par[a]);
	}
	//trueなら1,falseなら0
	int same(int a,int b){
		if(root(a)==root(b)) return 1;
		else return 0;
	}
	//a,bが違う根っこの元なら結合する,結合したらtrueを返す
	bool unite(int a,int b){
		a=root(a),b=root(b);
		if(a==b) return false;
		if(wei[a]<wei[b]) std::swap(a,b);
		par[b]=a;
		q.push_back(b);
		if(wei[a]==wei[b]){
			G[a].push_back(b);
			ans[b]=(ans[b]*jyo(ans[a],mod-2,mod))%mod;
			ans[a]=(ans[a]*((mod+1)/2))%mod;
		}else ans[b]=0;
		wei[a]+=wei[b];
		return true;
	}
	void out(){
		queue<int> q;
		int n=wei.size();
		rep(i,n){
			if(ans[i]==0||root(i)==i) q.push(i);
		}
		rep(i,n){
			int a=q.front();
			q.pop();
			for(auto x:G[a]){
				ans[x]=(ans[x]*ans[a])%mod;
				q.push(x);
			}
		}
		rep(i,n) cout<<ans[i]<<"\n";
	}
	private:
	std::vector<int> par;
};
}
using po167::UFtree;


void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N,M;
	cin>>N>>M;
	UFtree T(N);
	rep(i,M){
		int a,b; 
		cin>>a>>b; 
		a--,b--;
		T.unite(a,b);
	}
	T.out();
}