import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      auto A = new int[M];
      auto B = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt();
        B[i] = readInt();
      }
      
      auto adj = new bool[][](N, N);
      foreach (i; 0 .. M) {
        adj[A[i]][B[i]] = true;
        adj[B[i]][A[i]] = true;
      }
      
      int ans;
      foreach (a; 0 .. N) foreach (b; 0 .. N) foreach (c; 0 .. N) foreach (d; 0 .. N) {
        if (adj[a][b] && adj[b][c] && adj[c][d] && adj[d][a]) {
          if (a != c && b != d && !adj[a][c] && !adj[b][d]) {
            ++ans;
          }
        }
      }
      ans /= 8;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}