#include <bits/stdc++.h>
using namespace std;
int n, m;
int dp[800][800][10];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    dp[x][y][1]++;
    dp[y][x][1]++;
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (i != j)
        for (int q = 1; q <= n; q++)
          if (q != i && q != j) {
            dp[i][j][2] += dp[i][q][1] * dp[j][q][1];
          }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (i != j) {
        for (int q = 1; q <= n; q++)
          if (q != i && q != j) {
            dp[i][j][3] += dp[i][q][2] * dp[j][q][1] +
                           dp[i][q][1] * dp[j][q][2] -
                           dp[i][j][1] * dp[i][q][1] * dp[i][q][1] -
                           dp[i][j][1] * dp[j][q][1] * dp[j][q][1];
          }
        dp[i][j][3] /= 2;
      }
  long long sum = 0;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++)
      if (i != j && dp[i][j][3] != 0 && dp[i][j][2] != 0) {
        for (int q = 1; q <= n; q++)
          if (q != i && q != j && dp[i][q][1] != 0 && dp[j][q][1] != 0) {
            sum += dp[i][j][3];
            sum -= dp[j][q][2] - dp[i][j][1] + dp[i][q][2] - dp[i][j][1];
          }
      }
  printf("%lld", sum / 10);
  return 0;
}
