#include <bits/stdc++.h>
const int maxn = 100001;
int a[maxn], b[maxn], c[maxn], t[maxn];
int main() {
  int n, k, x, d = 0, p = 0;
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &x);
    if (x > 0)
      a[x]++;
    else
      b[-x]++, d++;
    t[i] = x;
  }
  for (int i = 1; i <= n; i++) {
    if (a[i] + d - b[i] > k)
      c[i] = -1;
    else
      p++;
  }
  for (int i = 0; i < n; i++) {
    x = t[i];
    if (x > 0) {
      if (c[x] == -1)
        puts("Lie");
      else
        puts(p != 1 ? "Not defined" : "Truth");
    } else {
      x = -x;
      if (c[x] == -1)
        puts("Truth");
      else
        puts(p != 1 ? "Lie" : "Not defined");
    }
  }
}
