#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
namespace Dup4 {
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  for (; !isdigit(c); c = getchar()) f ^= (c == '-');
  for (; isdigit(c); c = getchar()) x = x * 10 + (c - '0');
  return x * (f ? 1 : -1);
}
template <typename T>
inline void read(T &x) {
  x = 0;
  int f = 1;
  char c = getchar();
  for (; !isdigit(c); c = getchar()) f ^= (c == '-');
  for (; isdigit(c); c = getchar()) x = x * 10 + (c - '0');
  x *= f ? 1 : -1;
}
template <typename T>
inline void write(T x) {
  if (!x) {
    putchar(48);
    return;
  }
  if (x < 0) x = -x, putchar('-');
  int bit[20], i, p = 0;
  for (; x; x /= 10) bit[++p] = x % 10;
  for (i = p; i; --i) putchar(bit[i] + 48);
}
inline char nc() {
  static char buf[100000], *i = buf, *j = buf;
  return i == j && (j = (i = buf) + fread(buf, 1, 100000, stdin), i == j)
             ? EOF
             : *i++;
}
template <typename T>
inline void _read(T &sum) {
  char ch = nc();
  sum = 0;
  while (!(ch >= '0' && ch <= '9')) ch = nc();
  while (ch >= '0' && ch <= '9') sum = sum * 10 + ch - 48, ch = nc();
}
template <typename T>
inline T gcd(T a, T b) {
  while (b ^= a ^= b ^= a %= b)
    ;
  return a;
}
const double PI = acos(-1.0);
const double EI = exp(1.0);
const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const long long INFLL = 0x3f3f3f3f3f3f3f3fll;
}  // namespace Dup4
using namespace Dup4;
namespace FastIO {
bool IOerror = false;
inline char NC() {
  static char buf[10000005], *p1 = buf + 10000005, *pend = buf + 10000005;
  if (p1 == pend) {
    p1 = buf;
    pend = buf + fread(buf, 1, 10000005, stdin);
    if (pend == p1) {
      IOerror = true;
      return -1;
    }
  }
  return *p1++;
}
inline bool blank(char ch) {
  return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
inline void __read(char &x) {
  char ch;
  while (blank(ch = NC()))
    ;
  if (IOerror) {
    x = -1;
    return;
  }
  x = ch;
}
template <typename T>
inline void __read(T &x) {
  char ch;
  while (blank(ch = NC()))
    ;
  if (IOerror) {
    x = -1;
    return;
  }
  bool flag = false;
  if (ch == '-') {
    flag = true;
    ch = NC();
  }
  if (!isdigit(ch))
    while (!isdigit(ch = NC()))
      ;
  for (x = ch - '0'; isdigit(ch = NC()); x = x * 10 + ch - '0')
    ;
  if (flag) x *= -1;
}
}  // namespace FastIO
using namespace FastIO;
const int maxn = (int)1e5 + 10;
const int Maxn = (int)1e6 + 10;
const int MOD = (int)1e9 + 9;
int n, m;
int tot[2];
pair<int, int> arr[maxn];
unordered_map<int, int> mp[2];
inline bool Input() {
  if (scanf("%d%d", &n, &m) == EOF) return false;
  char c;
  int id;
  mp[0].clear(), mp[1].clear();
  memset(tot, (0), sizeof(tot));
  ;
  for (register int i = (1); i <= (n); ++i) {
    scanf(" %c%d", &c, &id);
    int vis = c == '-' ? 0 : 1;
    arr[i].first = vis, arr[i].second = id;
    mp[vis][id]++;
    tot[vis]++;
  }
  return true;
}
inline void Solve() {
  int index = -1;
  for (register int i = (1); i <= (n); ++i) {
    if (mp[1][i] + tot[0] - mp[0][i] == m) {
      if (index == -1)
        index = i;
      else {
        index = -1;
        break;
      }
    }
  }
  if (index != -1) {
    for (register int j = (1); j <= (n); ++j) {
      if (arr[j].second == index)
        puts(arr[j].first ? "Truth" : "Lie");
      else
        puts(arr[j].first ? "Lie" : "Truth");
    }
    return;
  }
  if (m == 0) {
    for (register int i = (1); i <= (n); ++i) puts("Lie");
    return;
  }
  if (m == n) {
    for (register int i = (1); i <= (n); ++i) puts("Truth");
    return;
  }
  int total = 0;
  for (register int i = (1); i <= (n); ++i) {
    if (mp[1][i] + tot[0] - mp[0][i] == m) total++;
  }
  if (total == 1) {
    for (register int i = (1); i <= (n); ++i) {
      int flag = mp[1][arr[i].second] + tot[0] - mp[0][arr[i].second];
      if (flag != m && arr[i].first == 0) puts("Truth");
      puts(flag == m ? "Truth" : "Lie");
    }
    return;
  } else {
    for (register int i = (1); i <= (n); ++i) {
      int flag = mp[1][arr[i].second] + tot[0] - mp[0][arr[i].second];
      if (arr[i].first == 0 && flag != m)
        puts("Truth");
      else
        puts(flag == m ? "Not defined" : "Lie");
    }
    return;
  }
}
inline void Run() {
  while (Input()) Solve();
}
int main() {
  Run();
  return 0;
}
