#include <bits/stdc++.h>
using namespace std;
const int MOD = 100003;
int n, m;
vector<int> e[1123456];
int dis[1123456];
int cnt[1123456];
queue<int> q;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int u, v;
        cin >> u >> v;
        e[u].push_back(v);
        e[v].push_back(u);
    }
    memset(dis, 0x3f, sizeof(dis));
    q.push(1);
    dis[1] = 0;
    cnt[1] = 1;
    while (!q.empty())
    {
        int u = q.front();
        q.pop();
        for (int i = 0; i < e[u].size(); i++)
        {
            int v = e[u][i];
            if (dis[u] + 1 < dis[v])
            {
                dis[v] = dis[u] + 1;
                cnt[v] = cnt[u];
                q.push(v);
            }
            else if (dis[u] + 1 == dis[v])
            {
                cnt[v] = (cnt[v] + cnt[u]) % MOD;
            }
        }
    }
    for (int i = 1; i <= n; i++)
        cout << cnt[i] << "\n";
    return 0;
}