#include<iostream>

#include<cstdio>

#include<cstring>

#define ll long long

using namespace std;

const int N=1e5+,M=5e5+;

int n,m,hd[N],xnt,siz[N],dfn[N],low[N],tim;

ll ans[N];

struct Ed{

  int nxt,to;Ed(int n=,int t=):nxt(n),to(t) {}

}ed[M<<];

void add(int x,int y)

{

  ed[++xnt]=Ed(hd[x],y);hd[x]=xnt;

  ed[++xnt]=Ed(hd[y],x);hd[y]=xnt;

}

void tarjan(int cr)

{

  dfn[cr]=low[cr]=++tim;siz[cr]=;

  ll t=;

  for(int i=hd[cr],v;i;i=ed[i].nxt)

    if(!dfn[v=ed[i].to])

      {

    tarjan(v);

    low[cr]=min(low[cr],low[v]);siz[cr]+=siz[v];

    if(low[v]>=dfn[cr])

      {

        ans[cr]+=t*siz[v];t+=siz[v];

      }

      }

    else low[cr]=min(low[cr],dfn[v]);

  ans[cr]+=t*(n-t-);

}

int main()

{

  scanf("%d%d",&n,&m);int x,y;

  for(int i=;i<=m;i++)

    {

      scanf("%d%d",&x,&y);add(x,y);

    }

  tarjan();

  for(int i=;i<=n;i++)

    printf("%lld\n",(ans[i]+n-)<<);

  return ;

}