#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
const int N=1e5+5;
int n,m,id[N];pair<int,int> x[N];
vector<int> G[N];vector<ull> bs[N];ull ans;
void upd(vector<ull>&f,int x){f[x>>6]|=1ull<<(x&63);}
int count(vector<ull>&f,vector<ull>&g){
    int res=0;
    for(int i=0;i<f.size();i++)
        res+=__builtin_popcountll(f[i]&g[i]);
    return res;
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1,u,v;i<=m;i++){
        scanf("%d%d",&u,&v);
        G[u].push_back(v);G[v].push_back(u);
    }
    for(int i=1;i<=n;i++)x[i]={G[i].size(),i};
    for(int i=1;i<=n;i++){
        sort(G[i].begin(),G[i].end(),[&](int a,int b){return x[a]<x[b];});
        while(G[i].size()&&x[G[i].back()]>x[i])G[i].pop_back();
    }
    for(int i=1;i<=n;i++)id[i]=-1;
    for(int u=1;u<=n;u++){
        int tot=0;for(int v:G[u])id[v]=tot++;
        for(int l=0;l<tot;l+=10000){
            int r=min(tot,l+10000),len=r-l;
            assert(l==0);
            for(int v:G[u]){
                if(l!=0)assert(id[v]==-1);
                bs[id[v]].resize((len>>6)+1);
                for(auto w:G[v])if(id[w]>=l&&id[w]<r)
                    upd(bs[id[v]],id[w]-l);
            }
            for(int v:G[u])for(int w:G[v])if(id[w]!=-1)
                ans+=count(bs[id[v]],bs[id[w]]);
            for(int v:G[u])bs[id[v]].clear();
        }
        for(int v:G[u])id[v]=-1;
    }
    printf("0 0 0 %lld\n",ans);
    return 0;
}