4

I could have asked you to calculate the number of anti-$K\_4$ subgraphs, but that would be just solving this problem and copying problem K from GP of Nanjing 2021 (https://codeforces.com/gym/103470/problem/K) (solution from ecnerwala --- https://codeforces.com/blog/entry/97762?#comment-866645), and why would I do this?

You are given a simple undirected graph. Calculate the number of its $K\_4$ subgraphs (sets of 4 vertices such that there are all 6 edges between them in the graph).

A simple graph. Come on. You got this. $4 \le n \le 100\\,000$, $0 \le m \le 100\\,000$. No self-loops or parallel edges, I promise.

This problem uses a standard checker.