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

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;

#define INF INT_MAX/3

#define MAX_N 1000

bool es[55][55];

int main(){
	cin.sync_with_stdio(false);
	int n,m;
	cin>>n>>m;
	rep(i,m){
		int a,b;
		cin>>a>>b;
		es[a][b]=true;
		es[b][a]=true;
	}
	int res=0;
	rep(i,n)rep(j,i)rep(k,j)rep(l,k){
		int a[3]={l,k,j};
		do{
			if(es[i][a[0]]&&es[a[0]][a[1]]&&es[a[1]][a[2]]&&es[a[2]][i]&&!es[i][a[1]]&&!es[a[0]][a[2]])res++;
		}while(next_permutation(a,a+3));
	}
	cout<<res/2<<endl;
	return 0;
}