#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

struct CountUnionFind{
    int sz;
    vector<int> par;
    vector<int> rank;
    vector<int> cnt;

    CountUnionFind(int n) : sz(n) {
        par.resize(sz);
        rank.assign(sz, 0);
        cnt.assign(sz, 1);
        for(int i = 0; i < sz; ++i){
            par[i] = i;
        }
    }

    int find(int x){
        if(par[x] == x) return x;
        else    return par[x] = find(par[x]);
    }

    bool same(int x, int y){
        return find(x) == find(y);
    }

    bool unite(int x, int y){
        x = find(x), y = find(y);
        if(x == y)  return false;
        if(rank[x] < rank[y]){
            par[x] = y;
            cnt[y] += cnt[x];
        }
        else{
            par[y] = x;
            cnt[x] += cnt[y];
            if(rank[x] == rank[y])  ++rank[x];
        }
        return true;
    }

    int get_cnt(int x){
        return cnt[find(x)];
    }
};

struct mint {
    int x;
    mint() : x(0) {}
    mint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    mint& operator+=(const mint& p){
        if((x += p.x) >= mod)   x -= mod;
        return *this;
    }
    mint& operator-=(const mint& p){
        if((x -= p.x) < 0)  x += mod;
        return *this;
    }
    mint& operator*=(const mint& p){
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }
    mint& operator/=(const mint& p){
        *this *= p.inverse();
        return *this;
    }
    mint operator-() const { return mint(-x); }
    mint operator+(const mint& p) const { return mint(*this) += p; }
    mint operator-(const mint& p) const { return mint(*this) -= p; }
    mint operator*(const mint& p) const { return mint(*this) *= p; }
    mint operator/(const mint& p) const { return mint(*this) /= p; }
    bool operator==(const mint& p) const { return x == p.x; }
    bool operator!=(const mint& p) const { return x != p.x; }
    mint pow(int64_t n) const {
        mint res = 1, mul = x;
        while(n > 0){
            if(n & 1)   res *= mul;
            mul *= mul;
            n >>= 1;
        }
        return res;
    }
    mint inverse() const { return pow(mod - 2); }
    friend ostream& operator<<(ostream& os, const mint& p){
        return os << p.x;
    }
    friend istream& operator>>(istream& is, mint& p){
        int64_t val;
        is >> val;
        p = mint(val);
        return is;
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, M, a, b;
    cin >> N >> M;
    CountUnionFind uf(N);
    map<int, mint> p;
    vector<vector<int>> vertices(N);
    for(int i = 0; i < N; ++i){
        p[i] = 1;
        vertices[i].emplace_back(i);
    }
    for(int i = 0; i < M; ++i){
        cin >> a >> b;
        --a, --b;
        if(uf.same(a, b))   continue;
        int A = uf.find(a), B = uf.find(b);
        int cnta = uf.get_cnt(A), cntb = uf.get_cnt(B);
        if(cnta < cntb){
            vertices[A].clear();
            p[A] = p[B];
        }
        else if(cnta > cntb){
            vertices[B].clear();
            p[B] = p[A];
        }
        else{
            if(p[A] == 1)   p[A] = p[B] = mint(1) / 2;
            else{
                mint nxt = p[A] * p[B];
                p[A] = p[B] = nxt;
            }
        }
        uf.unite(a, b);
        if(uf.find(a) == A){
            if(vertices[A].size() < vertices[B].size()){
                swap(vertices[A], vertices[B]);
            }
            while(vertices[B].size()){
                vertices[A].push_back(vertices[B].back());
                vertices[B].pop_back();
            }
        }
        else{
            if(vertices[A].size() > vertices[B].size()){
                swap(vertices[A], vertices[B]);
            }
            while(vertices[A].size()){
                vertices[B].push_back(vertices[A].back());
                vertices[A].pop_back();
            }
        }
    }
    vector<mint> ans(N);
    for(int i = 0; i < N; ++i){
        for(int v : vertices[i]) ans[v] = p[uf.find(v)];
    }
    
    for(int i = 0; i < N; ++i)  cout << ans[i] << '\n';

    return 0;
}