# include <algorithm>
using namespace std ;

# define f first
# define s second

const char FIN[] = "triplete.in", FOU[] = "triplete.out" ;

pair < short, short > X[65540] ;
unsigned char V[1 << 12][130];
int N, M, sol ;

int main () {
    freopen ( FIN, "r", stdin ) ;
    freopen ( FOU, "w", stdout ) ;

    scanf ( "%d %d", &N, &M ) ;

    for ( int i = 1, a , b ; i <= M; ++i ) {
        scanf ( "%d %d", &a, &b ) ;
        V[a][b >> 5] |= ( 1 << ( b & 31 ) ) ;
        V[b][a >> 5] |= ( 1 << ( a & 31 ) ) ;
        X[i].f = a, X[i].s = b ;

    }

    for ( int i = 1; i <= M; ++i ) {
        for ( int j = 0; j <= N >> 5; ++j ) {
            for ( int aux = V[ X[ i ].f ][ j ] & V[ X[ i ].s ][ j ] ; aux ; aux -= aux & ( -aux ) ) {
                ++sol;
            }
        }
    }

    printf ( "%d", sol / 3 ) ;

    return 0 ;
}