Given an undirected graph pf n vertices and m edges, the goal is to find the largest clique (a complete subgraph where every pair of vertices is connected) within the graph.
### Input
- First line contains two integers n and m.
- The next m lines, each line contains two integers u,v, there is an edge between u and v.
### Output
- The first line contains an integer k, the size of the clique.
- The second line contains k integers, denoting vertices of the clique.
### Constraints
- 1≤n≤200
- 1≤m≤n(n−1)2.
- 1≤u,v≤n.
### Example
Input:
451223134314
Output:
3123
### Scoring
- All test cases are scored equally.
- Consider the jury's answer as Y and your answer as X.
- If X≥Y, you receive a score of 100 for test case.
- If 1<YX≤1.5, your score for the test case is calculated as (3X−2YX)3×100.
- If YX>1.5, you receive a score of 0 for the test case.