#include <bits/stdc++.h>
using namespace std;
long long Set(long long N, long long pos) {
  if (pos < 0) return N;
  return N = N | (1ll << pos);
}
long long reset(long long N, long long pos) { return N = N & ~(1ll << pos); }
bool check(long long N, long long pos) {
  if (pos < 0) return 0;
  return (bool)(N & (1ll << pos));
}
void CI(long long &_x) { scanf("%d", &_x); }
void CO(long long &_x) { cout << _x; }
template <typename T>
void getarray(T a[], long long n) {
  for (long long i = 0; i < n; i++) cin >> a[i];
}
template <typename T>
void prLLIarray(T a[], long long n) {
  for (long long i = 0; i < n - 1; i++) cout << a[i] << " ";
  cout << a[n - 1] << endl;
}
const double EPS = 1e-9;
const long long INF = 0x7f7f7f7f;
long long dr8[8] = {1, -1, 0, 0, 1, -1, -1, 1};
long long dc8[8] = {0, 0, -1, 1, 1, 1, -1, -1};
long long dr4[4] = {0, 0, 1, -1};
long long dc4[4] = {-1, 1, 0, 0};
long long kn8r[8] = {1, 2, 2, 1, -1, -2, -2, -1};
long long kn8c[8] = {2, 1, -1, -2, -2, -1, 1, 2};
int doshi[100005];
int nirdosh[100005];
int papi[100005];
int kotha[100005];
int main() {
  int n, m;
  cin >> n >> m;
  int total_nirdosh = 0;
  for (long long i = 1; i <= n; i++) {
    int tem;
    cin >> tem;
    kotha[i] = tem;
    if (tem > 0)
      doshi[tem]++;
    else
      nirdosh[-tem]++, total_nirdosh++;
  }
  int total_papi = 0;
  for (int i = 1; i <= n; i++) {
    int sotto_kotha = doshi[i] + (total_nirdosh - nirdosh[i]);
    if (sotto_kotha == m) {
      papi[i] = 1;
      total_papi++;
    }
  }
  for (int i = 1; i <= n; i++)
    if (kotha[i] > 0) {
      if (papi[kotha[i]]) {
        if (total_papi == 1)
          puts("Truth");
        else
          puts("Not defined");
      } else
        puts("Lie");
    } else {
      if (papi[-kotha[i]]) {
        if (total_papi == 1)
          puts("Lie");
        else
          puts("Not defined");
      } else {
        puts("Truth");
      }
    }
}
