I. The Pentagon Conjecture
time limit per test
1.5 seconds
memory limit per test
1024 megabytes
input
standard input
output
standard output

Due to large input file size, each input file has been partitioned into $$$t$$$ smaller files, each with $$$1$$$ test case ($$$t = 1$$$). Below are the differences between the original problem and the problem on Codeforces:

  • $$$1 \le t \le 10 \to t = 1$$$.
  • Time limit: $$$10$$$ seconds $$$\to$$$ $$$1.5$$$ seconds.
Example
Input
1
7 28
1 2 3
1 2 4
1 2 5
1 2 6
1 2 7
1 3 4
1 3 5
1 3 6
1 3 7
1 4 5
1 4 6
1 4 7
1 5 6
1 5 7
1 6 7
2 3 4
2 3 5
2 3 6
2 3 7
2 4 5
2 4 6
2 4 7
2 5 6
2 5 7
2 6 7
3 4 5
3 4 6
3 4 7
Output
1 2 3 4 7