def main():
  from collections import deque
  n,m=map(int,input().split())
  g=[[] for _ in range(n)]
  for _ in range(m):
    a,b=map(int,input().split())
    a-=1
    b-=1
    g[a].append(b)
    g[b].append(a)
  dp=[[[False]*n for j in range(n)] for i in range(3)]
  for i in range(n):
    dp[0][i][i]=True
  bfs=deque([i*1000+i for i in range(n)])
  pop=bfs.popleft
  push=bfs.append
  while bfs:
    v=pop()
    d=v//1000000
    v%=1000000
    s=v//1000
    cur=v%1000
    if d==2:
      continue
    for to in g[cur]:
      if dp[d+1][s][to]:
        continue
      dp[d+1][s][to]=True
      push((d+1)*1000000+s*1000+to)
  ans=n*(n-1)*(n-2)//6
  for i in range(n):
    for j in range(i+1,n):
      for k in range(j+1,n):
        if not(dp[0][i][j] or dp[1][i][j]) and dp[2][i][j]:
          ans-=1
        elif not(dp[0][j][k] or dp[1][j][k]) and dp[2][j][k]:
          ans-=1
        elif not(dp[0][k][i] or dp[1][k][i]) and dp[2][k][i]:
          ans-=1
  print(ans)
main()