#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const double eps = 1e-9;
const int maxn = 1e5 + 5;
int a[maxn];
int b[maxn];
int ys[maxn];
int ans[maxn];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  memset(a, 0, sizeof(a));
  memset(b, 0, sizeof(b));
  int bcnt = 0;
  for (int i = 0; i < n; i++) {
    int val;
    scanf("%d", &val);
    ys[i] = val;
    if (val > 0) {
      a[val]++;
    } else {
      b[-val]++;
      bcnt++;
    }
  }
  int k = 0;
  for (int i = 1; i < n + 1; i++) {
    int cnt = a[i] + bcnt - b[i];
    if (cnt == m) {
      ans[k++] = i;
    }
  }
  set<int> s;
  for (int i = 0; i < k; i++) {
    s.insert(ans[i]);
  }
  if (k == 1) {
    for (int i = 0; i < n; i++) {
      if ((ys[i] == ans[0]) || (ys[i] < 0 && ys[i] != -ans[0])) {
        printf("Truth\n");
      } else {
        printf("Lie\n");
      }
    }
  } else {
    for (int i = 0; i < n; i++) {
      if (ys[i] > 0) {
        if (s.count(ys[i]) == 1)
          printf("Not defined\n");
        else
          printf("Lie\n");
      } else {
        if (s.count(-ys[i]) == 1)
          printf("Not defined\n");
        else
          printf("Truth\n");
      }
    }
  }
  return 0;
}
