All Graphs are not Trees.

You are given an unweighted, undirected graph. Write a program to check if it's a tree topology.

The first line of the input file contains two integers N and M --- number of nodes and number of edges in the graph . Next M lines contain M edges of that graph --- Each line contains a pair (u, v) means there is an edge between node u and node v (1 <= u,v <= N).

Example 1

Input:
3 2
1 2
2 3


Output:
TREE

Example 2
Input:
3 3
1 2
1 3
2 3

Output:
NOT A TREE