#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
const int N=1e5+10,M=2e5+10,mod=1e5+3;
typedef pair<int,int> PII;
struct node{
    int from,to,next;
}edge[M*2];
int head[N],cnt,dis[N],num[N];
int n,m;

void addedge(int u,int v){
    cnt++;
    edge[cnt].from=u;
    edge[cnt].to=v;
    edge[cnt].next=head[u];
    head[u]=cnt;
}

void spfa(int s){
    int st[N]={0};
    dis[1]=0;
    num[s]=1;
    queue<int>q;
    q.push(s);
    st[s]=1;
    while(!q.empty()){
        int now=q.front();q.pop();
        st[now]=0;
        for(int i=head[now];~i;i=edge[i].next){
            if(dis[edge[i].to]<=dis[now]) continue;
            if(dis[edge[i].to]==dis[now]+1) num[edge[i].to]+=num[now];
            else num[edge[i].to]=num[now];
            num[edge[i].to]%=mod;
            dis[edge[i].to]=dis[now]+1;
            if(st[edge[i].to]) continue;
            q.push(edge[i].to);
            st[edge[i].to]=1;
        }
    }
}

int main(){
    memset(head,-1,sizeof(head));
    memset(num,0,sizeof(num));
    memset(dis,0x3f,sizeof(dis));
    cin>>n>>m;
    for(int i=1,u,v;i<=m;i++){
        scanf("%d%d",&u,&v);
        addedge(u,v);
        addedge(v,u);
    }
    spfa(1);
    for(int i=1;i<=n;i++) cout<<num[i]<<endl;
    return 0;
}