#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}


int main() {
  ll n, m;std::cin >> n >> m;
  vvl d = VV(n, n, 0, ll);
  re(i, m){
    ll b, c;std::cin >> b >> c;
    d[b][c] = d[c][b] = 1;
  }
  ll ans = 0;
  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      for(int k=0;k<n;k++){
        for(int l=0;l<n;l++){
          set<ll> s;
          s.insert(i);
          s.insert(j);
          s.insert(k);
          s.insert(l);
          if(s.size()!=4) continue;
          if(d[i][j]&&d[j][k]&&d[k][l]&&d[l][i]&&(d[j][l]==0)&&(d[i][k]==0)){
            //std::cout << i << " " << j << " " << k << " " << l << '\n';
            ans++;
          }
        }
      }
    }
  }
  std::cout << ans/8 << '\n';

}