n, m = map(int, raw_input().split())
S = [0]*(n+1)
Y = [0]*(n+1)
N = [0]*(n+1)

for i in range(1, n+1):
        v = int(raw_input())
        S[i] = v
        if v > 0:
                Y[v] += 1
        else:
                N[-v] += 1

NC = len(filter(lambda n: n < 0, S))
P = [False]*(n+1)
np = 0
for i in range(1, n+1):
        if Y[i]+NC-N[i] == m:
                P[i] = True
                np += 1

for s in S:
        if s > 0:       # accuse
                if P[s]:
                        print 'Truth' if np == 1 else 'Not defined'
                else:
                        print 'Lie'
        elif s < 0:     # defense
                if P[-s]:
                        print 'Lie' if np == 1 else 'Not defined'
                else:
                        print 'Truth'


			 		 	  				 		  					    			