#include <fstream>
#include <bitset>

using namespace std;

ifstream fin("triplete.in");
ofstream fout("triplete.out");

int n, m;
bitset<4100> g[4100];
long long sol;

int main() {
    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        int x, y;
        fin >> x >> y;
        g[x][y] = 1;
        g[y][x] = 1;
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            if(g[i][j] == 1) {
                sol += (g[i] & g[j]).count();
            }
    fout << sol / 3 << '\n';
}