CF11D A Simple Task

Given a simple graph, output the number of simple cycles in it. A simple cycle is a cycle with no repeated vertices or edges.

The first line of input contains two integers $ n $ and $ m $ ( $ 1

Output the number of cycles in the given graph.

The example graph is a clique and contains four cycles of length 3 and three cycles of length 4.