#include <bits/stdc++.h>
using namespace std;
const int MAXN = (int)1e5 + 10;
struct node {
  char f;
  int val;
} a[MAXN];
int T[MAXN], F[MAXN];
bool peo[MAXN];
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  int sumT = 0, sumF = 0;
  for (int i = 1; i <= n; i++) {
    scanf(" %c%d", &a[i].f, &a[i].val);
    if (a[i].f == '+')
      T[a[i].val]++, sumT++;
    else
      F[a[i].val]++, sumF++;
  }
  int temp, num = 0;
  for (int i = 1; i <= n; i++) {
    temp = T[i] + sumF - F[i];
    if (temp == m) {
      peo[i] = true;
      num++;
    }
  }
  if (num == 1) {
    for (int i = 1; i <= n; i++) {
      if (a[i].f == '+' && peo[a[i].val])
        printf("Truth\n");
      else if (a[i].f == '-' && !peo[a[i].val])
        printf("Truth\n");
      else
        printf("Lie\n");
    }
  } else {
    for (int i = 1; i <= n; i++) {
      if (a[i].f == '+') {
        if (peo[a[i].val])
          printf("Not defined\n");
        else
          printf("Lie\n");
      } else {
        if (peo[a[i].val])
          printf("Not defined\n");
        else
          printf("Truth\n");
      }
    }
  }
  return 0;
}
