# Clique

# Clique

Cliquein an undirected graphis a subsetof vertices,two of whichare connectedby an edgeof the graph.In other words,it is a completesubgraphof the originalgraph.Cliquesizeis defined as thenumber of verticesin it.Your task- to determine thesize of the largestcliquein the graph.

**Input**

The firstline containsa single number -the number of tests**T**. This is followed bydescriptions of**T**tests.Eachtest descriptionbeginswith the lineon which thetwo integers**N** (**1** ≤ **N** ≤ **20**) and **M** (**0** ≤ **M** ≤ **N(N-1)/2**), where:

**N**– numberof vertices,**M**– number of edges.

This is followed by**M** lines, **i**^{th}linecontains a pairof numbers (**s _{i}**,

**f**) – numberof verticesbetween whichthere is an edge (

_{i}**1**≤

**s**,

_{i}**f**≤

_{i}**N**). All pairs (

**s**,

_{i}**f**) are different,one edgemay not bein the input datatwice.In thegraph has nomultiple edges(connectinganypair of verticesis at most oneedge).In thegraph has noelementarycycle(for each pair (

_{i}**s**,

_{i}**f**) is true, that

_{i}**s**≠

_{i}**f**).

_{i}**Output**

For each of the**T**testoutputon a linesingle number - thesize of the largestcliqueof the graph.

3 2 0 2 1 1 2 3 2 1 2 2 3

1 2 2