#include <bits/stdc++.h>
using namespace std;
inline short int abs(short int a) { return a > 0 ? a : -a; }
int main() {
  int n, m, cr, sumneg = 0;
  short int *rsp, *prs, *neg, fing, k = 0;
  scanf("%d%d", &n, &m);
  rsp = new short int[n];
  prs = new short int[n]();
  neg = new short int[n]();
  for (int i = 0; i < n; ++i) {
    scanf("%d", &cr);
    rsp[i] = (short int)cr;
    fing = abs((short int)cr) - 1;
    if (cr < 0) {
      ++sumneg;
      ++neg[fing];
    } else
      ++prs[fing];
  }
  cr = 0;
  while (k < 2 && cr < n) {
    if ((prs[cr] + sumneg - neg[cr]) == m) ++k;
    ++cr;
  }
  for (int i = 0; i < n; ++i) {
    fing = abs(rsp[i]) - 1;
    if ((prs[fing] + sumneg - neg[fing]) == m)
      printf(k == 1 ? (rsp[i] > 0 ? "Truth\n" : "Lie\n") : "Not defined\n");
    else
      printf(rsp[i] < 0 ? "Truth\n" : "Lie\n");
  }
  return 0;
}
