时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：5786

解决：902

//Asimple
//#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cctype>
#include <cstdlib>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <limits.h>
#include <time.h>
#define INF 0xfffffff
#define mod 100000
#define PI 3.14159265358979323
#define swap(a,b,t) t = a, a = b, b = t
#define CLS(a, v) memset(a, v, sizeof(a))
#define debug(a)  cout << #a << " = "  << a <<endl
#define dobug(a, b)  cout << #a << " = "  << a << " " << #b << " = " << b << endl
using namespace std;
typedef long long ll;
const int maxn = 101;
int n, m, num, T, k, len, ans, sum, x, y;
int Map[maxn][maxn];
int fa[maxn];
ll qpow(ll a, ll b, ll md) {
    ll ans = 1;
    while( b ) {
        if( b & 1 ) ans = ans * a % md;
        a = a * a % md;
        b = b >> 1;
    }
    return ans;
}
int find(int x) {
    return x==fa[x]?x:fa[x]=find(fa[x]);
}
 
void solve() {
    x = find(0);
    for(int i=1; i<n; i++) {
        if( x!=find(i) ) cout << "-1" << endl;
        else cout << Map[0][i] << endl;
    }
}
 
void input() {
    while( cin >> n >> m ) {
        for(int i=0; i<n; i++) {
            fa[i] = i;
            Map[i][i] = 0;
        }
        for(int i=0; i<m; i++) {
            cin >> x >> y;
            num = qpow(2, i, mod);
            int xx = find(x);
            int xy = find(y);
            if( xx==xy ) continue;
            for(int j=0; j<n; j++) {
                if( xx!=find(j) ) continue;
                for(int k=0; k<n; k++) {
                    if( xy!=find(k) ) continue;
                    Map[j][k] = Map[k][j] = (Map[j][x] + num + Map[y][k])%mod;
                }
            }
            fa[xy] = xx;
        }
        solve();
    }
}
 
int main(){
    input();
    return 0;
}