#include <bits/stdc++.h>
using namespace std;
int n, m, a[100011], c[100011] = {0}, d[100011] = {0}, sc, sd;
char L[10] = "Lie", N[20] = "Not defined", T[10] = "Truth";
int main() {
  scanf("%d%d", &n, &m);
  sc = 0, sd = 0;
  for (int i = (1); i <= (n); i++) {
    scanf("%d", a + i);
    if (a[i] > 0)
      c[a[i]]++;
    else
      d[-a[i]]++;
  }
  vector<int> vec;
  set<int> st;
  for (int i = (1); i <= (n); i++) sc += c[i], sd += d[i];
  for (int i = (1); i <= (n); i++) {
    if (c[i] + sd - d[i] == m) st.insert(i);
  }
  if (st.size() > 1) {
    for (int i = (1); i <= (n); i++) {
      if (a[i] > 0) {
        if (st.count(a[i]))
          puts(N);
        else
          puts(L);
      } else {
        if (st.count(-a[i]))
          puts(N);
        else
          puts(T);
      }
    }
  } else {
    for (int i = (1); i <= (n); i++) {
      if (a[i] > 0) {
        if (st.count(a[i]))
          puts(T);
        else
          puts(L);
      } else {
        if (st.count(-a[i]))
          puts(L);
        else
          puts(T);
      }
    }
  }
  return 0;
}
