/*
 ID: nik3daz1
 LANG: JAVA
 TASK: XXXX
 */
import java.util.*;
import java.io.*;
import static java.lang.Math.*;

public class Main {
	
	public static void main(String[] args) {
	    Scanner sc = new Scanner(System.in);
        PrintStream out = System.out;    
		//CODING TAIM
		
        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] accuse = new int[n + 1];
        int negs = 0;
        int[] accs = new int[n + 1];

        for (int i = 1; i <= n; i++) {
            String s = sc.next();
            if (s.charAt(0) == '+')
                s = s.substring(1);
            else
                negs++;
            int x = Integer.parseInt(s);
            accuse[i] = x;
        }

        for (int i = 1; i <= n; i++) {
            accs[i] = negs;
        }

        for (int i = 1; i <= n; i++) {
            if (accuse[i] < 0) {
                accs[-accuse[i]]--;
            }
            else if (accuse[i] > 0)
                accs[accuse[i]]++;
        }

        Set poss = new HashSet();
        for (int i = 1; i <= n; i++) {
            if (accs[i] == m)
                poss.add(i);
        }

        for (int i = 1; i <= n; i++) {
            if (accuse[i] > 0)
                if (poss.contains(accuse[i]))
                    if (poss.size() > 1)
                        out.println("Not defined");
                    else
                        out.println("Truth");
                else
                    out.println("Lie");
            else
                if (poss.contains(-accuse[i]))
                    if (poss.size() > 1)
                        out.println("Not defined");
                    else
                        out.println("Lie");
                else
                    out.println("Truth");
        }
                
                

        /*
        String s = sc.next();
        String u = sc.next();
        for (int i = 0; i < u.length(); i++)
            s = '.' + s + '.';
        char[] ss = s.toCharArray();
        char[] uu = u.toCharArray();
        
        int best = 0;
        for (int i = 0; i < ss.length - uu.length; i++) {
            int match = 0;
            for (int j = 0; j < uu.length; j++) {
                if (ss[i + j] == uu[j])
                    match++;
            }
            if (match > best)
                best = match;
        }
        out.println(uu.length - best);
        */

/*        int n = sc.nextInt();
        int[][] b = new int[n][n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                b[i][j] = sc.nextInt();
            }
        }
		int win = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                int r = 0;
                int c = 0;
                for (int k = 0; k < n; k++) {
                    r += b[i][k];
                    c += b[k][j];
                }
                if (c > r)
                    win++;
             }
        }
        out.println(win);
        */

        /*
        int n = sc.nextInt();
        
        ArrayList<Integer> l = new ArrayList<Integer>();
        for (int i = 0; i < n; i++) {
            l.add(sc.nextInt());
        }
        if (l.size() % 2 == 1)
            l.add(0);
        Collections.sort(l);
        double fine = 0;
        for (int i = l.size() - 1; i > 0; i-=2) {
            int x = l.get(i);
            int y = l.get(i - 1);
            fine += x * x;
            fine -= y * y;
        }
        out.println(fine * PI);
          */           
	}

}
