#include <bits/stdc++.h>
long long MOD = 1000000007;
long long inf = 1e18;
using namespace std;
int L[100001], Cnt1[100001], Cnt2[100001], p;
map<int, bool> P;
int main() {
  ios::sync_with_stdio(false);
  int n, m, i, j, x;
  char c;
  string ans;
  bool r;
  cin >> n >> m;
  for (i = 0; i < n; i++) {
    cin >> x;
    if (x > 0) {
      L[i] = x;
      Cnt1[x - 1]++;
    } else {
      L[i] = x;
      Cnt2[-x - 1]++;
      p++;
    }
  }
  for (i = 0; i < n; i++) {
    if ((Cnt1[i]) + (p - Cnt2[i]) != m) {
      continue;
    }
    P[i] = true;
  }
  for (i = 0; i < n; i++) {
    if (L[i] > 0) {
      L[i]--;
      if (P.find(L[i]) != P.end()) {
        if (P.size() == 1) {
          cout << "Truth\n";
        } else {
          cout << "Not defined\n";
        }
      } else {
        cout << "Lie\n";
      }
    } else {
      L[i] *= -1;
      L[i]--;
      if (P.find(L[i]) == P.end()) {
        cout << "Truth\n";
      } else {
        if (P.size() == 1) {
          cout << "Lie\n";
        } else {
          cout << "Not defined\n";
        }
      }
    }
  }
  return 0;
}
