#line 1 "main.cpp"
#include <atcoder/modint>
#include <atcoder/dsu>
#include <iostream>
#include <vector>
#include <cassert>

using namespace std;
using mint = atcoder::modint1000000007;

void solve() {
    int n, m;
    cin >> n >> m;

    vector<mint> ps(n, 1);
    atcoder::dsu dsu(n);
    vector<vector<int>> leaders(n);
    for (int v = 0; v < n; ++v) leaders[v].push_back(v);

    while (m--) {
        int u, v;
        cin >> u >> v;
        --u, --v;

        u = dsu.leader(u), v = dsu.leader(v);
        if (u == v) continue;

        if (dsu.size(u) > dsu.size(v)) swap(u, v);
        // size(u) <= size(v)

        if (dsu.size(u) == dsu.size(v)) {
            if (u != dsu.merge(u, v)) swap(u, v);
            // uが新しいleader

            move(leaders[v].begin(), leaders[v].end(), back_inserter(leaders[u]));
            for (auto x : leaders[u]) ps[x] /= 2;

        } else {
            assert(v == dsu.merge(u, v));

            // vがleaderになる
            for (auto x : leaders[u]) ps[x] = 0;
            leaders[u].clear();
        }

        dsu.merge(u, v);
    }

    for (auto p : ps) cout << p.val() << "\n";
}

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

    solve();

    return 0;
}