import java.io.*;
import java.util.*;
import java.math.*;

public class Main
{
	BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	StringTokenizer tokenizer=null;
	
	public static void main(String[] args) throws IOException
	{
		new Main().execute();
	}
	
	void debug(Object...os)
	{
		System.out.println(Arrays.deepToString(os));
	}
	
	int ni() throws IOException
	{
		return Integer.parseInt(ns());
	}
	
	long nl() throws IOException 
	{
		return Long.parseLong(ns());
	}
	
	double nd() throws IOException 
	{
		return Double.parseDouble(ns());
	}
		
	String ns() throws IOException 
	{
		while (tokenizer == null || !tokenizer.hasMoreTokens()) 
			tokenizer = new StringTokenizer(br.readLine());
		return tokenizer.nextToken();
	}
	
	String nline() throws IOException
	{
		tokenizer=null;
		return br.readLine();
	}
		
	
	//Main Code starts Here
	int totalCases, testNum;	
	int m,n;
	int[][] p;
	void execute() throws IOException
	{
		totalCases = 1;
		for(testNum = 1; testNum <= totalCases; testNum++)
		{
			input();
			solve();
		}
	}
	ArrayList<Integer> sus;

	void solve()
	{
		sus = new ArrayList<Integer>();
		for(int i = 1;i<n+1;i++)
		{
			int total = p[i][0]+neg-p[i][1];
			if(total==m)
				sus.add(i);
		}
		//debug(sus);
		int count = sus.size();
		for(int i = 1 ;i<p.length;i++)
		{
			if(v[i]>0)
			{
				if(sus.contains(v[i]))
				{
					if(count==1)
						System.out.println("Truth");
					else
						System.out.println("Not Defined");
				}
				else
					System.out.println("Lie");
			}
			else
			{
				if(!sus.contains(-1*v[i]))
					System.out.println("Truth");
				else
				{
					if(count==1)
						System.out.println("Lie");
					else
						System.out.println("Not Defined");
				}
			}
		}	
		
	}
	
	void printarr(int [] a,int b)
	{
		for(int i = 0;i<=b;i++)
		{
			if(i==0)
				System.out.print(a[i]);
			else
				System.out.print(" "+a[i]);
		}
		System.out.println();
	}
	int pos,neg;
	int[] v;
	boolean input() throws IOException
	{
		n = ni();
		m = ni();
		pos=neg=0;
		p = new int[n+1][2];
		v = new int[n+1];
		for(int i = 1 ;i<n+1;i++)
		{
			String s = ns();
			if(s.charAt(0)=='+')
			{
				p[Integer.parseInt(s.substring(1,s.length()))][0]++;
				v[i] = Integer.parseInt(s.substring(1,s.length()));
				pos++;
			}
			else
			{
				p[Integer.parseInt(s.substring(1,s.length()))][1]++;
				v[i] = -1* Integer.parseInt(s.substring(1,s.length()));
				neg++;

			}
			
		}
		//debug(v);
		return true;
	}
}
