#include <bits/stdc++.h>
const int N = 100000 + 5;
int n, m;
int a[N];
int cnt[N], cnt_not[N];
bool can[N];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  int tot_cnt = 0, tot_cnt_not = 0;
  for (int i = 1; i <= n; ++i) {
    if (a[i] > 0)
      ++cnt[a[i]], ++tot_cnt;
    else
      ++cnt_not[-a[i]], ++tot_cnt_not;
  }
  int cnt_can = 0;
  for (int i = 1; i <= n; ++i) {
    if (cnt[i] + tot_cnt_not - cnt_not[i] == m) {
      can[i] = true;
      ++cnt_can;
    }
  }
  for (int i = 1; i <= n; ++i) {
    if (a[i] > 0) {
      if (!can[a[i]])
        puts("Lie");
      else if (cnt_can == 1)
        puts("Truth");
      else
        puts("Not defined");
    } else {
      if (!can[-a[i]])
        puts("Truth");
      else if (cnt_can == 1)
        puts("Lie");
      else
        puts("Not defined");
    }
  }
  return 0;
}
