#include <bits/stdc++.h>
using namespace std;
set<int> s;
int yes[110000];
int no[110000];
int a[110000][2];
int main() {
  int n, m, i, ct = 0;
  scanf("%d %d", &n, &m);
  for (i = 0; i < n; i++) {
    int num;
    scanf("%d", &num);
    if (num < 0) {
      no[(-num) - 1]++;
      a[i][1] = (-num) - 1;
      ct++;
    } else {
      yes[num - 1]++;
      a[i][1] = num - 1;
    }
    a[i][0] = num > 0;
  }
  int check = 0;
  for (i = 0; i < n; i++) {
    if (yes[i] + (ct - no[i]) == m) {
      s.insert(i);
      check++;
    }
  }
  for (i = 0; i < n; i++) {
    set<int>::iterator it = s.find(a[i][1]);
    if (a[i][0]) {
      if (it == s.end())
        printf("Lie\n");
      else if (check == 1)
        printf("Truth\n");
      else
        printf("Not defined\n");
    } else {
      if (it == s.end())
        printf("Truth\n");
      else if (check == 1)
        printf("Lie\n");
      else
        printf("Not defined\n");
    }
  }
  return 0;
}
