#include <stdio.h>

#include <set>

#include <math.h>

#include <vector>

#include <algorithm>

using namespace std;

const int maxn = 100005;

typedef long long LL;

vector <int> G[maxn];

set <LL> s;

int n, m, vis[maxn], linker[maxn], out[maxn];

int main()

{

    while(scanf("%d %d", &n, &m) != EOF)

    {

        s.clear();

        for(int i=1; i<=n; i++){

            vis[i] = out[i] = linker[i] = 0;

            G[i].clear();

        }

        for(int i=1; i<=m; i++){

            int x, y;

            scanf("%d %d", &x,&y);

            G[x].push_back(y),out[x]++;

            G[y].push_back(x),out[y]++;

            s.insert((LL)x*n+y);

            s.insert((LL)y*n+x);

        }

        int B = sqrt(m);

        LL ans = 0;

        for(int i=1; i<=n; i++){

            int x = i, y;

            vis[x] = 1;

            for(int j=0; j<G[x].size(); j++) linker[G[x][j]] = x;

            for(int j=0; j<G[x].size(); j++){

                LL sum = 0;

                y = G[x][j];

                if(vis[y]) continue;

                if(out[y]<=B){

                    for(int k=0; k<G[y].size(); k++){

                        int z = G[y][k];

                        if(linker[z]==x) sum++;

                    }

                }else{

                    for(int k=0; k<G[x].size(); k++){

                        int z = G[x][k];

                        if(s.find((LL)z*n+y) != s.end()) sum++;

                    }

                }

                ans = ans + sum*(sum-1)/2;

            }

        }

        printf("%lld\n", ans);

    }

    return 0;

}