#include <bits/stdc++.h>
using namespace std;
const int maxn = 200001;
int T[maxn], F[maxn], a[maxn];
int ST = 0, SF = 0;
int n, m;
int possible[maxn], cnt = 0;
int main() {
  char ch;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    if (a[i] > 0) {
      T[a[i]]++;
      ST++;
    } else {
      F[-a[i]]++;
      SF++;
    }
  }
  for (int i = 1; i <= n; ++i) {
    if (T[i] + SF - F[i] == m) {
      possible[i] = 1;
      cnt++;
    }
  }
  for (int i = 1; i <= n; ++i) {
    if (a[i] > 0) {
      if (possible[a[i]] == 0)
        printf("Lie\n");
      else {
        if (cnt > 1)
          printf("Not defined\n");
        else
          printf("Truth\n");
      }
    } else {
      if (possible[-a[i]] == 0)
        printf("Truth\n");
      else {
        if (cnt > 1)
          printf("Not defined\n");
        else
          printf("Lie\n");
      }
    }
  }
  return 0;
}
