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

typedef long long ll;

const int N = 2e5 + 5;
const int M = 4e5 + 5;

const int base = 10;
const int mod = 1e9 + 7;

int n, m, fa[N], u[M], v[M];

vector <int> vec[N];

ll ans[N], tag1[N], tag2[N];

inline int _find(int u) {
	return (fa[u] == u) ? u : (fa[u] = _find(fa[u]));
}

inline ll qpow(ll a, ll b) {
	ll res = 1;
	while (b) {
		if (b & 1) {
			res = res * a % mod;
		}
		a = a * a % mod;
		b >>= 1;
	}
	return res;
}

inline ll inv(ll a) {
	return qpow(a, mod - 2);
}

inline void merge(int u, int v, int w) {
	int fu = _find(u), fv = _find(v);
	if (fu == fv) {
		return;
	}
	if (vec[fu].size() > vec[fv].size()) {
		swap(u, v);
		swap(fu, fv);
	}
	ll p = (ans[u] * tag1[fu] + tag2[fu]) % mod, q = (ans[v] * tag1[fv] + tag2[fv]) % mod;
	for (auto u: vec[fu]) {
		ans[u] = (ans[u] * tag1[fu] + tag2[fu]) % mod;
		ans[u] = (ans[u] * base + w) % mod;
		ans[u] = (ans[u] * qpow(base, vec[fv].size() - 1) + q) % mod;
	}
	tag1[fv] = tag1[fv] * base % mod;
	tag2[fv] = (tag2[fv] * base + w) % mod;
	ll t = qpow(base, vec[fu].size() - 1);
	tag1[fv] = tag1[fv] * t % mod;
	tag2[fv] = (tag2[fv] * t + p) % mod;
	fa[fu] = fv;
	for (auto u: vec[fu]) {
		vec[fv].emplace_back(u);
		ans[u] = (ans[u] - tag2[fv] + mod) * inv(tag1[fv]) % mod;
	}
}

int main() {
	#ifdef LOCAL
		assert(freopen("test.in", "r", stdin));
		assert(freopen("test.out", "w", stdout));
	#endif
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		fa[i] = i;
		vec[i].emplace_back(i);
		tag1[i] = 1, tag2[i] = 0;
	}
	for (int i = 1; i <= m; ++i) {
		cin >> u[i] >> v[i];
	}
	for (int i = 1; i <= m; ++i) {
		merge(u[i], v[i], i);
	}
	for (int i = 1; i <= n; ++i) {
		cout << (ans[i] * tag1[_find(i)] + tag2[_find(i)]) % mod << "\n";
	}
	return 0;
}