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

#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  ll n,m;cin >> n >> m;
  vvl mat(n,vl(n));
  rep(i,m){
    ll a,b;cin >> a >> b;mat[a][b]++;mat[b][a]++;
  }
  ll ans=0;
  rep(i,n){
    rep(j,i){
      rep(k,j){
        rep(l,k){
          vl v={l,k,j,i};
          ll cnt=0;
          rep(x,4)rep(y,4)cnt+=mat[v[x]][v[y]];
          if(cnt!=8)continue;
          do{
            bool ok=true;
            rep(i,4){
              if(!mat[v[i]][v[(i+1)%4]])ok=false;
            }
            ans+=ok;
          }while(next_permutation(all(v)));
        }
      }
    }
  }
  cout << ans/8 << endl;
}