#include <bits/stdc++.h>
using namespace std;
int A[100005];
int B[100005];
int n, m, y, cn, cc;
char ch;
set<int> S;
int main() {
  scanf("%d ", &n);
  scanf("%d ", &m);
  cn = 0, cc = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%c", &ch);
    scanf("%d ", &A[i]);
    if (ch == '-') A[i] *= -1;
    if (A[i] > 0) {
      B[A[i]]++;
      cc++;
    } else
      cn++;
  }
  int sus = 0;
  for (int i = 1; i <= n; i++) {
    if (B[i] <= m) {
      sus++;
      S.insert(i);
    }
  }
  for (int i = 1; i <= n; i++) {
    if (A[i] > 0) {
      if (S.find(A[i]) != S.end() && sus == 1 && cn <= n - m - 1) {
        printf("Truth\n");
      } else if (S.find(A[i]) != S.end() && sus > 1 && cn <= m - 1) {
        printf("Not defined\n");
      } else {
        printf("Lie\n");
      }
    } else {
      if (S.find(-A[i]) == S.end()) {
        printf("Truth\n");
      } else if (S.find(-A[i]) != S.end() && sus == 1) {
        printf("Lie\n");
      } else {
        printf("Not defined\n");
      }
    }
  }
  return 0;
}
