#include <bits/stdc++.h>
using namespace std;
const int inft = 1000000009;
const int MAXN = 1000006;
int S[2][MAXN], A[MAXN];
char C[MAXN], P[MAXN];
void solve() {
  int n, m;
  scanf("%d%d", &n, &m);
  int sum = 0;
  for (int i = 0; i < (n); ++i) {
    scanf(" %c%d", &C[i], &A[i]);
    C[i] = C[i] == '+';
    A[i]--;
    S[C[i]][A[i]]++;
    sum += !C[i];
  }
  int pot = 0;
  for (int i = 0; i < (n); ++i) {
    if (sum - S[0][i] + S[1][i] == m) {
      pot++;
      P[i] = 1;
    }
  }
  assert(pot > 0);
  for (int i = 0; i < (n); ++i) {
    if (pot > 1 && P[A[i]])
      puts("Not defined");
    else
      puts(C[i] == P[A[i]] ? "Truth" : "Lie");
  }
}
int main() {
  int t = 1;
  for (int i = 0; i < (t); ++i) solve();
  return 0;
}
