#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#include <algorithm>
#include <utility>
#include <cstring>
#include <string>
#include <stack>
#include <deque>
#include <iomanip>
#include <set>
#include <map>
#include <cassert>
#include <ctime>
#include <list>
#include <iomanip>

using namespace std;

string file = "triplete";

ifstream cin( (file + ".in").c_str() );
ofstream cout( (file + ".out").c_str() );

const int MAXN = 4100;
const int oo = (1<<31)-1;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

struct ClassComp {
    inline bool operator () (const int &a, const int &b) const {
        return a > b;
    }
};

bitset<MAXN> G[MAXN];
vector< pair<int, int> > Edges;
int N, M;

int main() {
    cin >> N >> M;
    for(int i = 1 ; i <= M ; ++ i) {
        int x, y;
        cin >> x >> y;
        Edges.push_back(make_pair(x, y));
        G[x][y] = 1;
        G[y][x] = 1;
    }
    long long Ans = 0;
    for(int i = 0 ; i < M ; ++ i) {
        int x = Edges[i].first;
        int y = Edges[i].second;
        Ans += ((bitset<MAXN>)G[x]&G[y]).count();
    }
    cout << Ans / 3 << '\n';
    cin.close();
    cout.close();
    return 0;
}