#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 100
#endif

int N,M;
typedef pair<int,int> A;
vector<A> G;

set<int> E[SIZE];

bool check(int a, int b, int c, int d) {
    if (a==c||a==d||b==c||b==c) return false;
    if (E[a].count(c) && E[b].count(d) && !E[a].count(d) && !E[b].count(c)) return true;
    return false;
}

void solve() {
    cin>>N>>M;
    int u,v;
    REP(i,M) {
        cin>>u>>v;
        G.push_back(*new A(u,v));
        E[u].insert(v);
        E[v].insert(u);
    }
    int ans = 0;
    for (auto p:G) for (auto q:G) if (p.first!=q.first || p.second!=q.second) {
        if (check(p.first, p.second, q.first, q.second))
            ans++;
        if (check(p.first, p.second, q.second, q.first))
            ans++;
    }
    cout << ans/4 << endl;
}