Problem: Koala Land consists of m bidirectional roads connecting n cities. The roads are numbered from 1 to m by order in input. It is guaranteed, that one can reach any city from every other city.

Koala starts traveling from city 1. Whenever he travels on a road, he writes its number down in his notebook. He doesn't put spaces between the numbers, so they all get concatenated into a single number.

Before embarking on his trip, Koala is curious about the resulting number for all possible destinations. For each possible destination, what is the smallest number he could have written for it?

Since these numbers may be quite large, print their remainders modulo 10^9+7. Please note, that you need to compute the remainder of the minimum possible number, not the minimum possible remainder.

Input

The first line contains two integers n and m (2 ≤ n ≤ 10^5, n - 1 ≤ m ≤ 10^5), the number of cities and the number of roads, respectively.

The i-th of the following m lines contains integers x_i and y_i (1 ≤ x_i, y_i ≤ n, x_i ≠ y_i), representing a bidirectional road between cities x_i and y_i.

It is guaranteed, that for any pair of cities there is at most one road connecting them, and that one can reach any city from every other city. 

Output

Print n - 1 integers, the answer for every city except for the first city.

The i-th integer should be equal to the smallest number he could have written for destination i+1. Since this number may be large, output its remainder modulo 10^9+7.

Examples

Input


11 10
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11


Output


1
12
123
1234
12345
123456
1234567
12345678
123456789
345678826


Input


12 19
1 2
2 3
2 4
2 5
2 6
2 7
2 8
2 9
2 10
3 11
11 12
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10


Output


1
12
13
14
15
16
17
18
19
1210
121011


Input


12 14
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11
11 12
1 3
1 4
1 10


Output


1
12
13
134
1345
13456
1498
149
14
1410
141011

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 500;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int LOG = 20;
const int ALP = 30;
const int BASE = 31337;
const double EPS = 1e-9;
const double PI = 3.1415926535;
int par[N][LOG], n, m;
int F[N], dep[N], tez[N], cnt = 2, dp[N], post[N][10];
vector<pair<int, int> > v[N];
int cmp(int i, int j) {
  if (dep[i] != dep[j]) return dep[i] < dep[j];
  for (int k = LOG - 1; k >= 0; k--)
    if (par[i][k] != par[j][k]) i = par[i][k], j = par[j][k];
  if (tez[i] == tez[j]) return 2;
  return tez[i] < tez[j];
}
bool p_cmp(pair<int, int> A, pair<int, int> B) {
  int ret = cmp(A.first, B.first);
  if (ret == 2) return A.second < B.second;
  return !ret;
}
priority_queue<pair<int, int>, vector<pair<int, int> >, decltype(&p_cmp)> P(
    p_cmp);
inline int add(const int &A, const int &B) {
  if (A + B >= MOD) return A + B - MOD;
  return A + B;
}
inline int mul(const int &A, const int &B) { return (long long)A * B % MOD; }
int get_node(int i, int x) {
  if (post[i][x]) return post[i][x];
  par[cnt][0] = i, tez[cnt] = x;
  dp[cnt] = add(x, mul(dp[i], 10));
  dep[cnt] = dep[i] + 1;
  post[i][x] = cnt;
  for (int k = 1; k < LOG; k++) par[cnt][k] = par[par[cnt][k - 1]][k - 1];
  return cnt++;
}
int stvori(int i, int x) {
  int pot = 1;
  for (; x >= pot; pot *= 10)
    ;
  pot /= 10;
  for (; pot >= 1; pot /= 10) {
    i = get_node(i, x / pot);
    x %= pot;
  }
  return i;
}
void dijkstra() {
  memset(F, -1, sizeof(F));
  P.push({0, 1});
  for (; !P.empty();) {
    pair<int, int> beg = P.top();
    P.pop();
    int cur = beg.second;
    if (F[cur] != -1) continue;
    F[cur] = beg.first;
    for (pair<int, int> nxt : v[cur]) {
      if (F[nxt.first] == -1) {
        P.push({stvori(F[cur], nxt.second), nxt.first});
      }
    }
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    v[x].push_back({y, i + 1});
    v[y].push_back({x, i + 1});
  }
  dijkstra();
  for (int i = 2; i <= n; i++) printf("%d\n", dp[F[i]], F[i]);
  return 0;
}