#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr int MOD = 1e9 + 7;

int inverse(int x) {
    return x == 1 ? 1 : 1LL * (MOD - MOD / x) * inverse(MOD % x) % MOD;
}

void madd(int &x, int y) {
    if ((x += y) >= MOD) {
        x -= MOD;
    }
}

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

    int n, m;
    cin >> n >> m;

    vector<int> fa(n), tag(n), sz(n, 1), power(n + 2, 1);
    iota(fa.begin(), fa.end(), 0);
    power[1] = inverse(10);
    for (int i = 2; i <= n; ++i) {
        power[i] = 1LL * power[1] * power[i - 1] % MOD;
    }

    auto find = [&](int x) -> pair<int, int> {
        int sum = tag[x];
        while (x != fa[x]) {
            madd(sum, tag[x = fa[x]]);
        }
        return {x, sum};
    };

    auto unite = [&](int x, int y, int e) {
        int sx, sy;
        tie(x, sx) = find(x), tie(y, sy) = find(y);
        if (x == y) {
            return;
        }
        if (sz[x] < sz[y]) {
            swap(x, y);
        }
        madd(tag[x], 1LL * power[sz[x]] * sy % MOD);
        madd(tag[x], 1LL * power[sz[x] - 1] * e % MOD);
        madd(tag[y], 1LL * power[sz[y]] * sx % MOD);
        madd(tag[y], 1LL * power[sz[y] - 1] * e % MOD);
        madd(tag[y], MOD - tag[x]);
        sz[x] += sz[y];
        fa[y] = x;
    };

    for (int i = 0; i < m; ++i) {
        int a, b;
        cin >> a >> b;
        --a, --b;
        unite(a, b, i + 1);
    }

    int p = 1;
    for (int i = 1; i < n - 1; ++i) {
        p = 10LL * p % MOD;
    }

    for (int i = 0; i < n; ++i) {
        cout << find(i).second * 1LL * p % MOD << '\n';
    }

    return 0;
}