#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T bpow(T p, T e) {
  unsigned long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p);
    p = (p * p);
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int toInt(string s) {
  int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
int toLlint(string s) {
  long long int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
int ts, kk = 1;
int n, m;
int ac[100005], de[100005];
vector<int> v;
int a[100005];
bool on[100005];
int main() {
  int t, i, j, k;
  int tot = 0;
  scanf("%d%d", &n, &m);
  for (i = 0; i < n; i++) {
    scanf("%d", &k);
    a[i + 1] = k;
    if (k < 0)
      de[-k]++;
    else
      ac[k]++, tot++;
  }
  for (i = 1; i <= n; i++) {
    k = ac[i] + (n - tot) - de[i];
    if (k == m) {
      v.push_back(i);
      on[i] = 1;
    }
  }
  if (v.size() == 0) {
    for (i = 1; i < n + 1; i++)
      if (a[i] > 0)
        printf("Lie\n");
      else
        printf("Not defined\n");
    return 0;
  }
  if (v.size() == 1) {
    t = v[0];
    for (i = 1; i <= n; i++) {
      if (a[i] == t)
        printf("Truth\n");
      else if (a[i] == -t || a[i] > 0)
        printf("Lie\n");
      else
        printf("Truth\n");
    }
    return 0;
  }
  for (i = 1; i < n + 1; i++) {
    if (a[i] > 0) {
      if (on[a[i]])
        printf("Not defined\n");
      else
        printf("Lie\n");
    } else {
      if (on[-a[i]])
        printf("Not defined\n");
      else
        printf("Truth\n");
    }
  }
  return 0;
}
