#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
inline int in() {
  int x;
  scanf("%d", &x);
  return x;
}
inline long long lin() {
  long long x;
  scanf("%I64d", &x);
  return x;
}
int n, k;
int f[N], inp[N], kunt[N];
set<int> sotto, mittha;
int main() {
  n = in();
  k = in();
  int a = 0, b = 0;
  for (int i = 1; i <= n; i++) {
    inp[i] = in();
    if (inp[i] > 0) a++;
    if (inp[i] < 0) b++;
    if (inp[i] > 0) sotto.insert(inp[i]);
    if (inp[i] < 0) mittha.insert(inp[i]);
  }
  if (n == 1 && inp[n] < 0) {
    puts("Lie");
    return 0;
  }
  if (a == k && sotto.size() == 1) {
    for (int i = 1; i <= n; i++) {
      if (inp[i] > 0)
        puts("Truth");
      else
        puts("Lie");
    }
  } else {
    for (int i = 1; i <= n; i++) {
      if (inp[i] > 0)
        puts("Lie");
      else
        puts("Not defined");
    }
  }
}
