#include <bits/stdc++.h>
using namespace std;

namespace K4{
	typedef long long ll;
	const int maxn=100000;
	int n,m;
	vector<int> g[maxn+50];
	int deg[maxn+50];
	void init(){
		cin >> n >> m;
		for (int i=1;i<=m;i++){
			int x,y;
			cin >> x >> y;
			g[x].push_back(y);
			g[y].push_back(x);
			deg[x]++;
			deg[y]++;
		}
	}
	ll gao(ll n,const vector<vector<int>> &G){
		ll ans=0;
		vector< bitset<maxn+1> > ok(n+1);
		for (int u=1;u<=n;u++){
			for (auto v:G[u]) ok[u][v]=1;	
		}
		for (int u=1;u<=n;u++){
			for (auto v:G[u]){
				ans+=(ok[u]&ok[v]).count();
			}
		}
		return ans;
	}
	vector<int> G[maxn+50];
	ll solve(){
		ll ans=0;
		vector<int> order(n+5);
		for (int i=1;i<=n;i++) order[i]=i;
		sort(order.begin()+1,order.begin()+n+1,
			[&](int x,int y){
				return (deg[x]==deg[y])?(x<y):(deg[x]<deg[y]);	
			}
		);
		vector<int> rk(n+5);
		for (int i=1;i<=n;i++) rk[order[i]]=i;
		for (int u=1;u<=n;u++){
			for (auto v:g[u]) if (rk[u]<rk[v]){
				G[rk[u]].push_back(rk[v]);	
			}
		}
		for (int i=1;i<=n;i++) sort(G[i].begin(),G[i].end());
		
		vector<vector<int>> subG(n+1);
		for (int u=1;u<=n;u++){
			int top=0;
			vector<int> id(n+1);
			for (auto v:G[u]) id[v]=++top;
			
			vector<vector<int>> tag(n+1);
			for (auto v:G[u]){
				for (auto w:G[v]) tag[w].push_back(v);
				for (auto w:tag[v]){
					subG[id[w]].push_back(id[v]);
					subG[id[v]].push_back(id[w]);
				}
				ans=ans+gao(top,subG)/3;
			}
			for (int i=1;i<=top;i++) subG[i].clear();
		}
		return ans;
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	K4::init();
	cout << K4::solve()/2 << "\n";
	return 0;	
}