#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include <bits/stdc++.h>
using namespace std;
using i32 = int; using i64 = long long int; using f64 = double; using str = string;
template <typename T> using vec = vector<T>;
template <typename T> using heap = priority_queue<T, vec<T>, greater<T>>;
#define times(n, i) for (i32 i = 0; i < (n); ++i)
#define range(a, b, i) for (i32 i = (a); i < (b); ++i)
#define upto(a, b, i) for (i32 i = (a); i <= (b); ++i)
#define downto(a, b, i) for (i32 i = (a); i >= (b); --i)
#define all(xs) (xs).begin(), (xs).end()
#define sortall(xs) sort(all(xs))
#define reverseall(xs) reverse(all(xs))
#define uniqueall(xs) (xs).erase(unique(all(xs)), (xs).end())
#define even(x) (((x) & 1) == 0)
#define odd(x) (((x) & 1) == 1)
#define append emplace_back
const i64 MOD = 1000000007;

i32 n, m;
vec<i32> e[50];

i32 main()
{
    cin >> n >> m;
    times(m, i) {
        i32 a, b; cin >> a >> b;
        e[a].append(b);
        e[b].append(a);
    }
    times(n, i) {
        sortall(e[i]);
    }
    i32 ans = 0;
    times(n, i) {
        times(e[i].size(), jj) {
            i32 j = e[i][jj];
            times(e[j].size(), kk) {
                i32 k = e[j][kk];
                if (k == i) continue;
                if (binary_search(all(e[i]), k)) continue;
                times(e[k].size(), ll) {
                    i32 l = e[k][ll];
                    if (l == i) continue;
                    if (l == j) continue;
                    if (binary_search(all(e[j]), l)) continue;
                    if (binary_search(all(e[i]), l))
                        ans++;
                }
            }
        }
    }
    cout << ans / 8 << endl;
    return 0;
}