#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const int INF = 0x7f7f7f7f;
const int maxn = 111111;
int a[maxn], b[maxn];
bool canbe[maxn];
int c[maxn], cnt, neg, pos;
int is[maxn], no[maxn];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) {
    int t;
    scanf("%d", &t);
    a[i] = t;
    b[i] = abs(t);
    if (t > 0)
      is[t]++;
    else
      no[-t]++, neg++;
  }
  for (int i = 1; i <= n; i++) {
    if (is[i] + neg - no[i] == m) {
      ++cnt;
      canbe[i] = true;
    }
  }
  for (int i = 1; i <= n; i++) {
    int t = a[i];
    if (t > 0) {
      if (canbe[t]) {
        if (cnt == 1)
          puts("Truth");
        else
          puts("Not defined");
      } else
        puts("Lie");
    } else {
      if (canbe[-t]) {
        if (cnt == 1)
          puts("Lie");
        else
          puts("Not defined");
      } else
        puts("Truth");
    }
  }
  return 0;
}
