#pragma GCC optimize("O3")
#include<bits/stdc++.h> 
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>; 
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1,0,1,0},dx={0,-1,0,1};
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LCM(ll c,ll d){return c/GCD(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} __init;
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; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
struct mint{
using ull=unsigned long long int;
ull v;
mint(ll vv=0){s(vv%mod+mod);}
mint& s(ull vv){
v=vv<mod?vv:vv-mod;
return *this;
}
//オーバーロード
mint operator-()const{return mint()-*this;}//mint型にキャスト
mint&operator+=(const mint&val){return s(v+val.v);}
mint&operator-=(const mint&val){return s(v+mod-val.v);}
mint&operator*=(const mint&val){
v=ull(v)*val.v%mod;
return *this;
}
mint&operator/=(const mint&val){return *this*=val.inv();}
mint operator+(const mint&val){return mint(*this)+=val;}
mint operator-(const mint&val){return mint(*this)-=val;}
mint operator*(const mint&val){return mint(*this)*=val;}
mint operator/(const mint&val){return mint(*this)/=val;}
mint pow(ll n)const{
mint res(1),x(*this);
while(n){
if(n&1)res*=x;
x*=x;
n>>=1ll;
}
return res;
}
mint inv()const{return pow(mod-2);}
//拡張ユークリッドの互除法
/* mint inv()const{
int x,y;
int g=extgcd(v,mod,x,y);
assert(g==1);
if(x<0)x+=mod;
return mint(x);
}*/
friend ostream& operator<<(ostream&os,const mint&val){
return os<<val.v;
}//出力
bool operator<(const mint&val)const{return v<val.v;}
bool operator==(const mint&val)const{return v==val.v;}
bool operator>(const mint&val)const{return v>val.v;}
};
class UF{
public:
	vector<int> par,num;
	int find(int v){
		return (par[v]==v)? v: (par[v]=find(par[v]));
	}
  explicit UF(){}
	explicit UF(int N):par(N),num(N,1){
		iota(all(par),0);
	}
  void init(int N){
     par.assign(N,0);
     num.assign(N,1);
     iota(all(par),0);
  }
	void unite(int u,int v){
		u=find(u),v=find(v);
		if(u==v)return;
		if(num[u]<num[v])swap(u,v);
		num[u]+=num[v];
		par[v]=u;
	}
	bool same(int u,int v){
		return find(u)==find(v);
	}
	bool ispar(int v){
		return v==find(v);
	}
	int size(int v){
		return num[find(v)];
	}
};
int main(){
    int n,m;
    cin>>n>>m;
    UF uf(n);
    V<int> cnt(n,0);
    V<int> a(m),b(m);
    V<V<int>> g(n);
    for(int i=0;i<n;i++)g[i].emplace_back(i);
    for(int i=0;i<m;i++){
          cin>>a[i]>>b[i];
          --a[i];--b[i];
          if(uf.same(a[i],b[i]))continue;
          if(uf.size(a[i])==uf.size(b[i])){
                while(g[uf.find(b[i])].size()){
                        g[uf.find(a[i])].emplace_back(g[uf.find(b[i])].back());
                        g[uf.find(b[i])].pop_back();
                }
                for(int v:g[uf.find(a[i])])cnt[v]++;
                uf.unite(a[i],b[i]);
          }else{
              if(uf.size(a[i])<uf.size(b[i])){
                    while(g[uf.find(a[i])].size()){
                          cnt[g[uf.find(a[i])].back()]=-1;
                          g[uf.find(a[i])].pop_back();
                    }
              }else{
                    while(g[uf.find(b[i])].size()){
                          cnt[g[uf.find(b[i])].back()]=-1;
                          g[uf.find(b[i])].pop_back();
                    }                 
              }
              uf.unite(a[i],b[i]);

          }
    }
    for(int i=0;i<n;i++){
          if(cnt[i]==-1)cout<<0<<"\n";
          else{
               cout<<mint(2).pow(cnt[i]).inv()<<"\n";
          }
    }

}