#include <stdio.h>
//#include <algorithm>
#include <vector>

using namespace std;

#define nm 5000

vector <int> v[nm];

int viz[nm];

int n, m, i, x, y;
long long sol;

void read()

{
	scanf("%d %d", &n, &m);

    for (i=1; i<=m; i++)
    {
        scanf("%d %d", &x, &y);

        v[x].push_back(y);
        v[y].push_back(x);
    }
}


void dfs(int p, int l)

{
    if (l == 3)
    {
    	if (p == i)
        	sol ++;
    }
    else
    {
    	int j;
        
        for (j=0; j<v[p].size(); j++)
        {
            if (viz[v[p][j]] == 0)
            {
            	viz[v[p][j]] = 1;
                
                dfs(v[p][j], l+1);
                
                viz[v[p][j]] = 0;
            }
        }
    }
}


void solve()

{
	sol = 0;
    
    for (i=1; i<=n; i++)
    {
        dfs(i, 0);
    }

    sol /= 6;
}


void write()

{
	printf("%lld\n", sol);
}


int main()

{
	freopen("triplete.in", "r", stdin);
    freopen("triplete.out","w",stdout);

    read();
    solve();
    write();

    fclose(stdin);
    fclose(stdout);

	return 0;
}