#include <bits/stdc++.h>
using namespace std;
int main() {
  int j, d;
  int n, m, i, a[100005], b[100005], c[10005];
  int s1, s2, cnt, ans[100005];
  while (~scanf("%d%d", &n, &m)) {
    s1 = s2 = 0;
    memset(a, 0, sizeof(a));
    memset(b, 0, sizeof(b));
    for (i = 1; i <= n; i++) {
      scanf("%d", &c[i]);
      if (c[i] > 0) {
        a[c[i]]++;
        s1++;
      } else {
        b[-c[i]]++;
        s2++;
      }
    }
    cnt = 0;
    for (i = 1; i <= n; i++) {
      if ((a[i] + s2 - b[i]) == m) {
        ans[++cnt] = i;
      }
    }
    if (cnt == 1) {
      for (i = 1; i <= n; i++) {
        if (c[i] > 0) {
          if (c[i] == ans[1]) {
            printf("Truth\n");
          } else {
            printf("Lie\n");
          }
        } else {
          if (c[i] == -ans[1]) {
            printf("Lie\n");
          } else {
            printf("Truth\n");
          }
        }
      }
    } else {
      for (i = 1; i <= n; i++) {
        d = lower_bound(ans + 1, ans + 1 + cnt, abs(c[i])) - ans;
        if (c[i] > 0) {
          if (c[i] == ans[d]) {
            printf("Not defined\n");
          } else {
            printf("Lie\n");
          }
        } else {
          if (-c[i] == ans[d]) {
            printf("Not defined\n");
          } else {
            printf("True\n");
          }
        }
      }
    }
  }
  return 0;
}
