#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, -1, 1};
const int N = 100010;
int n, m;
int cs[N], cn[N];
int ts, tn;
int v[N];
int ok[N];
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 0; i < n; ++i) {
    scanf("%d", v + i);
    if (v[i] > 0)
      cs[v[i] - 1]++, ts++;
    else
      cn[-1 * v[i] - 1]++, tn++;
  }
  int cok = 0;
  for (int i = 0; i < n; ++i) {
    int foo = cs[i] + (tn - cn[i]);
    if (foo == m) {
      ok[i] = 1;
      cok++;
    }
  }
  for (int i = 0; i < n; ++i) {
    if (v[i] > 0) {
      if (ok[v[i] - 1]) {
        if (cok == 1)
          puts("Truth");
        else
          puts("Not defined");
      } else
        puts("Lie");
    } else {
      if (ok[-1 * v[i] - 1]) {
        if (cok == 1)
          puts("Lie");
        else
          puts("Not defined");
      } else
        puts("Truth");
    }
  }
  return 0;
}
