import java.io.InputStreamReader;
import java.io.IOException;
import java.util.Arrays;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.StringTokenizer;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author Nova
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		OutputWriter out = new OutputWriter(outputStream);
		TaskD solver = new TaskD();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskD {

    public void solve(int testNumber, InputReader in, OutputWriter out) {
        int n = in.nextInt();
        int m = in.nextInt();
        int[] a = new int[n + 1];
        boolean[] crime = new boolean[n + 1];
        int[] cp = new int[n + 1];
        int[] cm = new int[n + 1];
        Arrays.fill(cp, 0);
        Arrays.fill(cm, 0);
        for (int i = 1; i <= n; i++) {
            String inp = in.next();
            a[i] = Integer.parseInt(inp.substring(1));
            if (inp.charAt(0) == '-') a[i] = -a[i];

            if (a[i] > 0) cp[a[i]]++;
            else cm[-a[i]]++;
        }
        int total = 0;
        int count = 0;
        Arrays.fill(crime, false);
        for (int i = 1; i <= n; i++)
            total += cm[i];
        for (int i = 1; i <= n; i++) {
            int temp = total - cm[i] + cp[i];
            if (temp == m) {
                count++;
                crime[i] = true;
            }
        }
        int[] res = new int[n + 1];
        Arrays.fill(res, 2);
        for (int i = 1; i <= n; i++) {
            if (a[i] > 0) {
                if (crime[a[i]]) {
                    if (count > 1) res[i] = 2;
                    else res[i] = 1;
                } else res[i] = 0;
            } else {
                if (crime[-a[i]]) {
                    if (count > 1) res[i] = 2;
                    else res[i] = 0;
                } else res[i] = 1;
            }
        }
        for (int i = 1; i <= n; i++) {
            switch (res[i]) {
                case 0:
                    out.println("Lie");
                    break;
                case 1:
                    out.println("Truth");
                    break;
                case 2:
                    out.println("Not defined");
                    break;
            }
        }
    }
}

class InputReader {
    private BufferedReader reader;
    private StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream));
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }
    
    }

class OutputWriter {
    private final PrintWriter writer;

    public OutputWriter(OutputStream outputStream) {
        writer = new PrintWriter(outputStream);
    }

    public OutputWriter(Writer writer) {
        this.writer = new PrintWriter(writer);
    }

    public void print(Object... objects) {
        for (int i = 0; i < objects.length; i++) {
            writer.print(objects[i]);
        }
    }

    public void println(Object... objects) {
        print(objects);
        writer.println();
    }

    public void close() {
        writer.close();
    }
}

