#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
inline bool checkBit(long long n, int i) { return n & (1LL << i); }
inline long long setBit(long long n, int i) {
  return n | (1LL << i);
  ;
}
inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); }
int dx[] = {0, 0, +1, -1};
int dy[] = {+1, -1, 0, 0};
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
inline bool isLeapYear(long long year) {
  return (year % 400 == 0) || (year % 4 == 0 && year % 100 != 0);
}
inline void normal(long long &a) {
  a %= 1000000007;
  (a < 0) && (a += 1000000007);
}
inline long long modMul(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a * b) % 1000000007;
}
inline long long modAdd(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  return (a + b) % 1000000007;
}
inline long long modSub(long long a, long long b) {
  a %= 1000000007, b %= 1000000007;
  normal(a), normal(b);
  a -= b;
  normal(a);
  return a;
}
inline long long modPow(long long b, long long p) {
  long long r = 1;
  while (p) {
    if (p & 1) r = modMul(r, b);
    b = modMul(b, b);
    p >>= 1;
  }
  return r;
}
inline long long modInverse(long long a) { return modPow(a, 1000000007 - 2); }
inline long long modDiv(long long a, long long b) {
  return modMul(a, modInverse(b));
}
const int MX = 101000;
int a[MX], bad[MX], good[MX], n, korse[MX];
void ansGen(int x) {
  for (int i = 1; i <= n; ++i) {
    if (a[i] < 0) {
      if (-1 * a[i] != x)
        cout << "Truth" << '\n';
      else
        cout << "Lie" << '\n';
    } else {
      if (a[i] == x)
        cout << "Truth" << '\n';
      else
        cout << "Lie" << '\n';
    }
  }
  exit(0);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int m, khrap = 0, kharap = 0;
  cin >> n >> m;
  int badsum = 0, goodsum = 0;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    if (a[i] < 0)
      bad[-1 * a[i]]++, badsum++;
    else
      good[a[i]]++, goodsum++;
  }
  for (int i = 1; i <= n; ++i) {
    int t = good[i] + badsum - bad[i];
    if (t == m) korse[i] = 1, ++kharap, khrap = i;
  }
  if (kharap == 1) ansGen(khrap);
  for (int i = 1; i <= n; ++i) {
    ;
    if (a[i] < 0) {
      if (korse[-1 * a[i]])
        cout << "Not defined" << '\n';
      else
        cout << "Truth" << '\n';
    } else {
      if (korse[a[i]])
        cout << "Not defined" << '\n';
      else
        cout << "Lie" << '\n';
    }
  }
  return 0;
}
