import java.util.*;
import java.math.*;
public class codeforces {
		 static int dp[][];
		
         public static void main(String[] args)
        {
                Scanner sc=new Scanner(System.in);
                int n=sc.nextInt();
                int m=sc.nextInt();
                int pdp[]=new int[n];
                int sdp[]=new int[n];
                int tp=0;
                int ts=0;
                int a[]=new int[n];
                int pp[]=new int[n+1];
                int ss[]=new int[n+1];
                for(int i=0;i<n;i++)
                {
                	String s=sc.next();
                	if(s.charAt(0)=='+')
                	{
                		a[i]=Integer.parseInt(s.substring(1));
                	}else
                	{
                		a[i]=Integer.parseInt(s);
                	}
                	if(a[i]>0)
                	{
                		tp++;
                		pdp[a[i]-1]++;
                	}else {
                		ts++;
                		sdp[0-(a[i]+1)]++;
                	}
                }
                for(int i=0;i<n;i++)
                {
                	pp[pdp[i]+ts-sdp[i]]++;
                	ss[sdp[i]]=1;
                }
                for(int i=0;i<n;i++)
                {
                	int p=0;
                	if(a[i]>0)
                	{
                		int t=a[i]-1;
                		if(pdp[a[i]-1]+ts-sdp[t]==m)
                			p|=1;
                		if(pp[m]-p>0)
                			p|=2;
                	}else
                	{
                		int t=-1-a[i];
                		if(pdp[t]+ts-sdp[t]==m)
                			p=2;
                		if(pp[m]-(p/2)>0)
                			p|=1;            		
                	}
                	if(p==1)
                		System.out.println("Truth");
                	if(p==2)
                		System.out.println("Lie");
                	if(p==3)
                		System.out.println("Not defined");
                	
                }
              
             
        }

}

class MultiList {
    int[] head;
    int[] next;
    int[] vert;
    int[] tramp;
    long[] cost;
    int cnt = 1;
    
    MultiList(int vNum, int eNum) {
            head = new int [vNum];
            next = new int [eNum + 1];
            vert = new int [eNum + 1];
            tramp = new int [eNum + 1];
            cost = new long [eNum + 1];
    }
    
    void add(int u, int v, long w,int t) {
            next[cnt] = head[u];
            vert[cnt] = v;
            tramp[cnt] = t;
            cost[cnt] = w;
            head[u] = cnt++;
    }
}

class node implements Comparable<node>{
        public int a;
        public int b;
        public node(int a,int b)
        {
                this.a=a;
                this.b=b;
        }
        public int compareTo(node a)
        {
               if(this.a>a.a)
                   return 1;
               if(this.a<a.a)
                   return -1;
               return a.b-this.b;
        }
}