#include <bits/stdc++.h>

using namespace std;

constexpr int mod = 1e9 + 7;

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<pair<int, int>>> g(n);
    for (int i = 0; i < m; ++i) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        g[a].emplace_back(b, i + 1);
        g[b].emplace_back(a, i + 1);
    }
    for (int i = 0; i < n; ++i) {
        int ans = 0;
        set<pair<int, int>> s;
        vector<int> used(n);
        used[i] = 1;
        for (auto [j, ind] : g[i]) {
            s.insert(make_pair(ind, j));
        }
        while (!s.empty()) {
            auto p = *s.begin();
            s.erase(s.begin());
            if (used[p.second]) {
                continue;
            }
            ans = (ans * 10LL + p.first) % mod;
            used[p.second] = 1;
            for (auto [j, ind] : g[p.second]) {
                if (!used[j]) {
                    s.insert(make_pair(ind, j));
                }
            }
        }
        cout << ans << '\n';
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}