#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

#include <atcoder/dsu>
#include <atcoder/modint>
using mint = atcoder::modint1000000007;

template <auto Merge>
struct ddsu;

template <typename T, T (*Merge)(T, T)>
struct ddsu<Merge> {
    ddsu(int n = 0, T v = T()):
        dsu_(n), data_(n, v) {
    }

    explicit ddsu(std::vector<T> v):
        dsu_(std::size(v)), data_() {
        data_ = std::move(v);
    }

    auto merge(int a, int b) {
        a = dsu_.leader(a);
        b = dsu_.leader(b);

        if (a == b) {
            return a;
        }

        int c = dsu_.merge(a, b);

        data_[c] = Merge(
            std::move(data_[a]),
            std::move(data_[b])
        );

        return c;
    }

    auto same(int a, int b) const {
        return dsu_.same(a, b);
    }

    auto leader(int a) const {
        return dsu_.leader(a);
    }

    auto size(int a) const {
        return dsu_.size(a);
    }

    auto groups() const {
        return dsu_.groups();
    }

    auto &data(int a) noexcept {
        return data_[dsu_.leader(a)];
    }

    const auto &data(int a) const noexcept {
        return data_[dsu_.leader(a)];
    }

private:
    mutable atcoder::dsu dsu_;
    std::vector<T> data_;
};

auto dmerge(vector<tuple<int, mint>> x, vector<tuple<int, mint>> y) {
    if (size(x) < size(y)) {
        swap(x, y);
    }

    if (size(x) != size(y)) {
        for (auto &[s, p] : y) {
            x.push_back({ s, 0 });
        }
        return x;
    }

    copy(begin(y), end(y), back_inserter(x));
    for (auto &[s, p] : x) {
        p /= 2;
    }
    return x;
}

int main() {
    int n, m; cin >> n >> m;

    ddsu<dmerge> dsu([&] {
        auto v = vec<tuple<int, mint>>(uns, n, 1);
        for (int i = 0; i < n; ++i) {
            v[i] = vec(make_tuple(i, mint(1)), 1);
        }
        return v;
    }());

    while (m--) {
        int a, b; cin >> a >> b; --a; --b;
        dsu.merge(a, b);
    }

    auto ans = vec<mint>(uns, n);

    for (auto _ : dsu.groups()) {
        for (auto [s, p] : dsu.data(_[0])) {
            ans[s] = p;
        }
    }

    for (auto v : ans) {
        cout << v.val() << endl;
    }
}