#include <bits/stdc++.h>
using namespace std;
const int MOD(1000000007);
const int INF((1 << 30) - 1);
const int MAXN(100005);
int a[MAXN], b[MAXN] = {0}, d[MAXN] = {0}, ans[MAXN];
int main() {
  int n, m, sumd = 0;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    if (a[i] > 0)
      b[a[i]]++;
    else
      d[-a[i]]++, sumd++;
  }
  int cnt = 0, x;
  for (int i = 1; i <= n; i++)
    if (b[i] + (sumd - d[i]) == m) ans[i] = 1, cnt++, x = i;
  if (cnt == 1) {
    for (int i = 1; i <= n; i++) {
      if (a[i] == x || (a[i] < 0 && a[i] != -x))
        printf("Truth\n");
      else
        printf("Lie\n");
    }
  } else {
    for (int i = 1; i <= n; i++)
      if (a[i] > 0 && !ans[a[i]])
        printf("Lie\n");
      else
        printf("Not defined\n");
  }
}
