import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;
import java.util.TreeSet;

public class Main {

    // class Scanner {
    // StreamTokenizer in;
    //
    // Scanner(InputStream stream) {
    // in = new StreamTokenizer(new BufferedReader(new InputStreamReader(
    // stream)));
    // in.resetSyntax();
    // in.whitespaceChars(0, 32);
    // in.wordChars(33, 255);
    // }
    //
    // String next() {
    // try {
    // in.nextToken();
    // return in.sval;
    // } catch (Exception e) {
    // throw new Error(e);
    // }
    // }
    //
    // int nextInt() {
    // return Integer.parseInt(next());
    // }
    //
    // long nextLong() {
    // return Long.parseLong(next());
    // }
    //
    // double nextDouble() {
    // return Double.parseDouble(next());
    // }
    // }

    class Man implements Comparable<Man> {
        int idx;
        ArrayList<Man> heIsKiller = new ArrayList<Main.Man>();
        ArrayList<Man> heIsNotKiller = new ArrayList<Main.Man>();
        Man heSad;
        boolean heSadKiller;
        static final String truth = "Truth";
        static final String nf = "Not defined";
        static final String lie = "Lie";
        String res;

        Man(int idx) {
            this.idx = idx;
        }

        public int compareTo(Man second) {
            return this.idx - second.idx;
        }
    }

    Scanner in;
    PrintWriter out;

    void solve() {
        int n = in.nextInt();
        int m = in.nextInt();
        Man mans[] = new Man[1 + n];
        for (int i = 1; i < mans.length; i++) {
            mans[i] = new Man(i);
        }
        in.nextLine();
        int nProtectors = 0;
        for (int i = 1; i <= n; i++) {
            String st = in.nextLine();
            int toWho = Integer.parseInt(st.substring(1));
            mans[i].heSad = mans[toWho];
            if (st.charAt(0) == '-') {
                mans[toWho].heIsNotKiller.add(mans[i]);
                nProtectors++;
                mans[i].heSadKiller = false;
            } else {
                mans[toWho].heIsKiller.add(mans[i]);
                mans[i].heSadKiller = true;
            }
        }
        TreeSet<Man> killers = new TreeSet<Main.Man>();
        int cnt = 0;
        for (int i = 1; i <= n; i++) {
            int votes = mans[i].heIsKiller.size() + nProtectors
                    - mans[i].heIsNotKiller.size();
            if (votes == m) {
                killers.add(mans[i]);
            }
        }
        if (killers.size() > 1) {
            for (int i = 1; i < mans.length; i++) {
                if (mans[i].heSadKiller && killers.contains(mans[i].heSad)){
                    mans[i].res = Man.nf;
                }else if (!mans[i].heSadKiller && killers.contains(mans[i].heSad)){
                    mans[i].res = Man.nf;
                }else{
                    mans[i].res = Man.lie;
                }
            }
        } else if (killers.size() == 1) {
            for (int i = 1; i < mans.length; i++) {
                if (mans[i].heSadKiller && killers.contains(mans[i].heSad)){
                    mans[i].res = Man.truth;
                }else if (!mans[i].heSadKiller && killers.contains(mans[i].heSad)){
                    mans[i].res = Man.lie;
                }else{
                    mans[i].res = Man.lie;
                }
            }
        }
        for (int i = 1; i < mans.length; i++) {
            out.println(mans[i].res);
        }

    }

    void run() {
        in = new Scanner(System.in);
        out = new PrintWriter(System.out);
        try {
            solve();
        } finally {
            out.close();
        }
    }

    public static void main(String[] args) {
        new Main().run();

    }

}
