Graph Construction

You are given integers $N$ and $K$. Construct a connected undirected unweighted graph with $N$ nodes (numbered $1$ through $N$) such that there are exactly $K$ unordered pairs of nodes which have distance equal to the diameter of the graph (the largest distance between two nodes), or determine that no such graph exists. ### Input - The first line of the input contains a single integer $T$ deno