#include <bits/stdc++.h>
using namespace std;
int a[100100];
int d[100100][2], can[100100];
int i, n, m, fa, ca, t;
int main() {
  scanf("%d%d", &n, &m);
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    if (a[i] > 0)
      d[a[i]][1]++;
    else
      d[0 - a[i]][0]++;
  }
  for (i = 1; i <= n; i++) {
    fa += d[i][1];
  }
  for (i = 1; i <= n; i++) {
    t = fa - d[i][1] + d[i][0];
    if (t != (n - m)) continue;
    ca++;
    can[i] = 1;
  }
  if (ca == 1) {
    for (i = 1; i <= n; i++) {
      if (a[i] > 0 && can[a[i]] || a[i] < 0 && !can[0 - a[i]])
        printf("Truth\n");
      else
        printf("Lie\n");
    }
  } else {
    for (i = 1; i <= n; i++) {
      if (a[i] > 0 && can[a[i]] || a[i] < 0 && can[0 - a[i]])
        printf("Not defined\n");
      else if (a[i] > 0 && !can[a[i]])
        printf("Lie\n");
      else
        printf("Truth\n");
    }
  }
  return 0;
}
