#include <bits/stdc++.h>
using namespace std;
vector<int> G, NG, T, can;
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  G.resize(n);
  NG.resize(n);
  T.resize(n);
  can.resize(n);
  int ng = 0;
  for (int i = (0); i < (n); ++i) {
    int a;
    scanf("%d", &a);
    if (a > 0) {
      ++G[a - 1];
      T[i] = a - 1;
    } else {
      ++NG[-a - 1];
      ++ng;
      T[i] = -a - 1;
    }
  }
  int count = 0;
  for (int i = (0); i < (n); ++i) {
    int val = G[i] + ng - NG[i];
    if (val == m) {
      can[i] = 1;
      ++count;
    }
  }
  for (int i = (0); i < (n); ++i)
    if (T[i] >= 0) {
      if (!can[T[i]])
        printf("Lie\n");
      else if (count == 1)
        printf("Truth\n");
      else
        printf("Not defined\n");
    } else {
      if (!can[T[i]])
        printf("Truth\n");
      else if (count == 1)
        printf("Lie\n");
      else
        printf("Not defined\n");
    }
  return 0;
}
