#include<bits/stdc++.h>
using namespace std;
constexpr int M=1e5+5;
map<int,int>edge[M];
vector<pair<int,int>>adj[M];
int n,m,ans,res,lim;queue<int>q;
bool in[M],vis[M][3];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
void insert(int x){
    if (!edge[x].empty()&&edge[x].size()<3&&!vis[x][edge[x].size()])
        vis[x][edge[x].size()]=1,q.push(x);
}
void dfs(int x,int f,int c){
    in[x]=1;
    for (auto [y,z]:adj[x])
        if (y>=lim&&y!=f){
            if (!in[y]) dfs(y,x,c*z);
            else if (y==lim) res+=c*z;
        }
    in[x]=0;
}
int main(){
    n=read();m=read();
    for (int i=1;i<=m;i++){
        int x=read(),y=read();
        edge[x][y]=edge[y][x]=1;
    }
    for (int i=1;i<=n;i++) insert(i);
    while (!q.empty()){
        int x=q.front();q.pop();
        if (edge[x].size()==1){
            auto [y,y_]=*edge[x].begin();
            edge[y].erase(x);insert(y);
        }
        if (edge[x].size()==2){
            auto [y,y_]=*edge[x].begin();
            auto [z,z_]=*edge[x].rbegin();
            const int tmp=y_*z_;
            if (edge[y].count(z)) ans+=tmp*edge[y][z];
            edge[y][z]+=tmp;edge[z][y]+=tmp;
            edge[y].erase(x);edge[z].erase(x);insert(y);insert(z);
        }
        edge[x].clear();
    }
    for (int x=1;x<=n;x++)
        for (auto [y,z]:edge[x])
            adj[x].emplace_back(y,z);
    for (int i=1;i<=n;i++)
        lim=i,dfs(i,0,1);
    printf("%d\n",ans+res/2);
    return 0;
}