#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
int a[100100] = {};
int k[200100] = {};
int d = 100050;
int can_be[100100] = {};
int main() {
  int n, m, x;
  int up = 0, down = 0;
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", a + i);
    if (a[i] > 0) ++up;
    ++k[d + a[i]];
  }
  down = n - up;
  int cank = 0;
  for (int i = 1; i <= n; ++i) {
    x = (down - k[d - i]) + k[d + i];
    if (can_be[i] = x == m) ++cank;
  }
  if (cank == 1) {
    for (int i = 1; i <= n; ++i) {
      if (a[i] < 0) {
        if (can_be[abs(a[i])])
          printf("Lie\n");
        else
          printf("Truth\n");
      } else {
        if (can_be[abs(a[i])])
          printf("Truth\n");
        else
          printf("Lie\n");
      }
    }
  } else {
    for (int i = 1; i <= n; ++i) {
      if (a[i] < 0) {
        if (can_be[abs(a[i])])
          printf("Not defined\n");
        else
          printf("Truth\n");
      } else {
        if (can_be[abs(a[i])])
          printf("Not defined\n");
        else
          printf("Lie\n");
      }
    }
  }
  return 0;
}
