#include <bits/stdc++.h>
const int oo = 0x3f3f3f3f;
template <typename T>
inline bool chkmax(T &a, T b) {
  return a < b ? a = b, true : false;
}
template <typename T>
inline bool chkmin(T &a, T b) {
  return b < a ? a = b, true : false;
}
std::string procStatus() {
  std::ifstream t("/proc/self/status");
  return std::string(std::istreambuf_iterator<char>(t),
                     std::istreambuf_iterator<char>());
}
template <typename T>
T read(T &first) {
  int f = 1;
  char ch = getchar_unlocked();
  for (; !isdigit(ch); ch = getchar_unlocked())
    if (ch == '-') f = -1;
  for (first = 0; isdigit(ch); ch = getchar_unlocked())
    first = 10 * first + ch - '0';
  return first *= f;
}
template <typename T>
void write(T first) {
  if (first == 0) {
    putchar_unlocked('0');
    return;
  }
  if (first < 0) {
    putchar_unlocked('-');
    first = -first;
  }
  static char s[20];
  int top = 0;
  for (; first; first /= 10) s[++top] = first % 10 + '0';
  while (top) putchar_unlocked(s[top--]);
}
const int MAXN = 1e5 + 5;
int N, M;
int A[MAXN];
void input() {
  read(N);
  read(M);
  for (int i = 1; i <= N; ++i) {
    read(A[i]);
  }
}
void solve() {
  static int cntp[MAXN], cntn[MAXN];
  int cntpall = 0, cntnall = 0;
  for (int i = 1; i <= N; ++i) {
    if (A[i] > 0) {
      ++cntp[A[i]];
      ++cntpall;
    } else {
      ++cntn[-A[i]];
      ++cntnall;
    }
  }
  static bool canbecrime[MAXN];
  int totcanbecrime = 0;
  for (int i = 1; i <= N; ++i) {
    if (cntp[i] + cntnall - cntn[i] == M) {
      canbecrime[i] = true;
      ++totcanbecrime;
    }
  }
  for (int i = 1; i <= N; ++i) {
    if (A[i] > 0) {
      if (!canbecrime[A[i]])
        puts("Lie");
      else if (totcanbecrime == 1)
        puts("Truth");
      else
        puts("Not defined");
    } else {
      if (!canbecrime[-A[i]])
        puts("Truth");
      else if (totcanbecrime == 1)
        puts("Lie");
      else
        puts("Not defined");
    }
  }
}
int main() {
  input();
  solve();
  return 0;
}
