#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = (int)1e9 + 7;
const int N = (int)1e6 + 7;
int n, m, a[N], num;
int yes[N], no[N], say_no, maybe[N];
void Init() {
  memset(yes, 0, sizeof(yes));
  memset(no, 0, sizeof(no));
  memset(maybe, 0, sizeof(maybe));
  say_no = num = 0;
  for (int i = (1); i < (n + 1); ++i) {
    int x;
    scanf("%d", &x);
    a[i] = x;
    if (x > 0) {
      yes[x]++;
    } else {
      no[-x]++;
      say_no++;
    }
  }
}
int Solve() {
  for (int i = (1); i < (n + 1); ++i) {
    if (yes[i] + (say_no - no[i]) == m) {
      maybe[i] = 1;
      num++;
    }
  }
  for (int i = (1); i < (n + 1); ++i) {
    if (a[i] > 0) {
      if (maybe[a[i]] && num == 1)
        puts("Truth");
      else if (!maybe[a[i]])
        puts("Lie");
      else
        puts("Not defined");
    } else {
      if (maybe[-a[i]] && num == 1)
        puts("Lie");
      else if (!maybe[-a[i]])
        puts("Truth");
      else
        puts("Not defined");
    }
  }
  return 0;
}
int main() {
  while (~scanf("%d%d", &n, &m)) {
    Init();
    Solve();
  }
  return 0;
}
