Today Death Moon found a tiny story:

One of my friends asked us a question during our dinner time, “What if a man has two eggs?” Now we are discussing whether we should tell him the truth.

And Death Moon imagined the ending:

N discussers organized K votings. Each one can at most gives M Agrees in one voting.

We say one voting is an Agree Voting if it maches the formula below:

( is everyone’s number of Agree)

And if there are half and more Agree Voting, then we decide to tell him the truth. Otherwise, we should tell nothing.

This problem contains several cases.
The first line of each case has two integers N, M and K which are mentioned before. (1 <= N <= 100, 1 <= M <= 100, 1 <= K <= 100)
Next follow K lines. Each line contains N integers A[i]. (0 <= A[i] <= M)

For each case, you should output ‘Truth’ if we decide to tell our poor friend. Otherwise, output ‘Nothing’.