#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const long long inf = numeric_limits<long long>::max() / 2;
const long double eps = 1e-9;
const long double pi = acos(-1);
template <typename T>
inline bool mineq(T& a, T b) {
  return (a > b) ? (a = b, 1) : 0;
}
template <typename T>
inline bool maxeq(T& a, T b) {
  return (a < b) ? (a = b, 1) : 0;
}
inline void solve(), read();
const string file = "";
int main() {
  if (file != "") {
    freopen((file + ".in").c_str(), "r", stdin);
    freopen((file + ".out").c_str(), "w", stdout);
  }
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
  read();
  solve();
  return 0;
}
long long n, m;
vector<vector<long long> > adj;
vector<vector<long long> > can;
vector<long long> d;
inline void solve() {
  can.assign(n, vector<long long>(n, 0));
  for (long long i = 0; i < n; i++) {
    for (long long j = i + 1; j < n; j++) {
      for (long long k = 0; k < n; k++) {
        if (adj[i][k] && adj[k][j]) {
          ++can[i][j];
          ++can[j][i];
        }
      }
    }
  }
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    for (long long j = i + 1; j < n; j++) {
      if (!adj[i][j]) {
        continue;
      }
      for (long long k = 0; k < n; k++) {
        if (i == k || j == k) {
          continue;
        }
        long long a1 = can[i][k];
        long long a2 = can[k][j];
        if (adj[i][k]) {
          --a2;
        }
        if (adj[k][j]) {
          --a1;
        }
        ans += a1 * a2;
        if (adj[i][k] && adj[k][j]) {
          ans -= d[k] - 2;
        }
      }
    }
  }
  ans /= 5;
  cout << ans << "\n";
}
inline void read() {
  cin >> n >> m;
  adj.resize(n, vector<long long>(n, 0));
  d.assign(n, 0);
  for (long long i = 0; i < m; i++) {
    long long v, u;
    cin >> v >> u;
    --v, --u;
    adj[v][u] = 1;
    adj[u][v] = 1;
    ++d[v], ++d[u];
  }
}
