#include <bits/stdc++.h>
using namespace std;
struct iii {
  int a, b, c;
  iii() {}
  iii(int a, int b, int c) : a(a), b(b), c(c) {}
  bool operator<(const iii& e) const {
    return a < e.a || a == e.a && (b < e.b || b == e.b && c < e.c);
  }
};
template <typename T>
T sq(const T& x) {
  return x * x;
}
template <typename T>
void minl(T& a, const T& b) {
  if (a > b) a = b;
}
template <typename T>
void maxl(T& a, const T& b) {
  if (a < b) a = b;
}
template <typename T>
void usort(vector<T>& a) {
  sort((a).begin(), (a).end());
  a.erase(unique((a).begin(), (a).end()), a.end());
}
template <typename T>
int index(const vector<T>& a, const T& x) {
  return lower_bound((a).begin(), (a).end(), x) - a.begin();
}
pair<int, int> operator+(const pair<int, int>& a, const pair<int, int>& b) {
  return pair<int, int>(a.first + b.first, a.second + b.second);
}
pair<int, int> operator-(const pair<int, int>& a, const pair<int, int>& b) {
  return pair<int, int>(a.first - b.first, a.second - b.second);
}
long long cross(const pair<int, int>& a, const pair<int, int>& b) {
  return (long long)a.first * b.second - (long long)b.first * a.second;
}
void york() {
  const int N = 700;
  static int c1[N][N];
  static int c2[N][N];
  static int c3[N][N];
  int n, m;
  long long ans = 0;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    c1[u][v] = c1[v][u] = 1;
  }
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++) {
      for (int k = 0; k < n; k++) c2[i][j] += c1[i][k] & c1[k][j];
      c2[j][i] = c2[i][j];
    }
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++) {
      for (int k = 0; k < n; k++) {
        if (k == i) continue;
        if (k == j) continue;
        c3[i][j] += c1[i][k] * (c2[k][j] - c1[i][j]);
      }
      c3[j][i] = c3[i][j];
    }
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++) {
      if (c2[i][j] == 0) continue;
      if (c3[i][j] == 0) continue;
      ans += (long long)c2[i][j] * c3[i][j];
      for (int k = 0; k < n; k++) {
        if (k == i) continue;
        if (k == j) continue;
        ans -=
            (long long)c1[i][k] * c1[j][k] * (c2[j][k] - (c1[i][j] & c1[k][j]));
        ans -=
            (long long)c1[j][k] * c1[i][k] * (c2[i][k] - (c1[i][j] & c1[k][i]));
      }
    }
  ans /= 5;
  printf("%I64d\n", ans);
}
int main() {
  york();
  return 0;
}
