#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>

using namespace std;

#define N 101
#define M 3001

int n,m;

int tot;
int front[N],nxt[M<<1],to[M<<1];

bool use[N][M],ok[M];
int sum[N],dis[N];
queue<int>q;

int dfn[N],low[N];
bool bridge[M];

void read(int &x)
{
    x=0; char c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) { x=x*10+c-‘0‘; c=getchar(); }
}

void add(int u,int v)
{
    to[++tot]=v; nxt[tot]=front[u]; front[u]=tot;
    to[++tot]=u; nxt[tot]=front[v]; front[v]=tot;
}

void tarjan(int u,int pre)
{
    dfn[u]=low[u]=++tot;
    for(int i=front[u];i;i=nxt[i])
    {
        if(i==(pre^1)) continue;
        if(!dfn[to[i]]) 
        {
            tarjan(to[i],i);
            low[u]=min(low[u],low[to[i]]);
            if(low[to[i]]>dfn[u]) bridge[i>>1]=true;
        }
        else low[u]=min(low[u],dfn[to[i]]);
    }
}

void bfs(int s)
{
    memset(dis,0,sizeof(dis));
    sum[s]=0;
    q.push(s);
    int now;
    while(!q.empty())
    {
        now=q.front();
        q.pop();
        for(int i=front[now];i;i=nxt[i])
            if(to[i]!=s && !dis[to[i]])
            {
                use[s][i>>1]=true;
                dis[to[i]]=dis[now]+1;
                sum[s]+=dis[to[i]];
                q.push(to[i]);
            }
    }
}

int bfs2(int s)
{
    int ans=0;
    memset(dis,0,sizeof(dis));
    q.push(s);
    int now;
    while(!q.empty())
    {
        now=q.front();
        q.pop();
        for(int i=front[now];i;i=nxt[i])
            if(ok[i>>1] && to[i]!=s && !dis[to[i]])
            {
                dis[to[i]]=dis[now]+1;
                ans+=dis[to[i]];
                q.push(to[i]);
            }
    }
    return ans;
}

void solve()
{
    
    int ans; 
    memset(ok,true,sizeof(ok));
    for(int i=1;i<=m;++i)
    {
        if(bridge[i]) 
        {
            puts("INF");
            continue;
        }
        ans=0; 
        for(int j=1;j<=n;++j)
            if(!use[j][i]) ans+=sum[j];
            else
            {
                ok[i]=false;
                ans+=bfs2(j);
                ok[i]=true;
            }
        printf("%d\n",ans);
    }
}

void clear()
{
    tot=1;
    memset(front,0,sizeof(front));
    memset(dfn,0,sizeof(dfn));
    memset(bridge,false,sizeof(bridge));
    memset(use,false,sizeof(use));
}

int main()
{
    int u,v;
    while(scanf("%d",&n)!=EOF)
    {
        clear();
        read(m);
        for(int i=1;i<=m;++i)
        {
            read(u); read(v);
            add(u,v);
        }
        for(int i=1;i<=n;++i) bfs(i);
        tot=0;
        tarjan(1,0);
        bool tag=false;
        for(int i=1;i<=n;++i)
            if(!dfn[i])
            {
                tag=true;
                break;
            }    
        if(!tag) solve();
        else 
        for(int i=1;i<=m;++i) puts("INF");
    }
}