#include <fstream>
#include <vector>
#include <algorithm>
#define f first
#define s second
#include<bitset>
using namespace std;
const int N = 4096;
int n, m, ceva;
pair<int ,int> v[65536];
bitset <N> a[N], k;
 
int main() {
    ifstream fin("triplete.in");
    ofstream fout("triplete.out");
    int aux, i, x, y;
    fin>>n>>m;
    for(i = 0; i < m; ++i) {
        fin>>x>>y;
       v[i].f = x - 1;
       v[i].s = y - 1;  a[x - 1][y - 1] = 1;
      a[y - 1][x - 1] = 1;
    }
     
    for(i = 0; i < m; ++i) {
        k = a[v[i].f] & a[v[i].s];
      ceva += k.count();
    }
    fout<<ceva / 3<<'\n';
   return 0;