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