#include <bits/stdc++.h>
using namespace std;
struct __io_dev {
  __io_dev(const bool& __fastio = false) {
    if (__fastio) ios_base::sync_with_stdio(false), cin.tie(nullptr);
    srand(time(nullptr));
    if (!string("").empty())
      freopen(
          ""
          ".in",
          "r", stdin),
          freopen(
              ""
              ".out",
              "w", stdout);
  }
  ~__io_dev() { fprintf(stderr, "%.6f ms\n", 1e3 * clock() / CLOCKS_PER_SEC); }
} __io(false);
const long long inf = (long long)1e+9 + 7ll;
const long long linf = (long long)1e+18 + 7ll;
const long double eps = (long double)1e-9;
const long double pi = acosl((long double)-1.0);
const int alph = 26;
const int maxs = 512l;
static char buff[(int)2e6 + 17];
long long __p[3] = {29ll, 31ll, 33ll};
long long __mod[3] = {inf, inf + 2ll, 14881337ll};
const int maxn = (int)3e5 + 17;
int n, m, cnt, k;
int killed[maxn], unkilled[maxn];
pair<char, int> q[maxn];
bool killer[maxn];
int to_int(string& s) {
  int res = 0;
  for (int i = 1; i < ((int)(s.size())); ++i) res = 10 * res + s[i] - '0';
  return res;
}
int main() {
  scanf("%d %d", &n, &m);
  for (long long i = 0ll; i < (long long)n; ++i) {
    scanf("%s", buff);
    string s = buff;
    int x = to_int(s) - 1;
    q[i] = {s[0], x};
    if (s[0] == '+')
      ++killed[x];
    else
      ++unkilled[x], ++cnt;
  }
  for (long long i = 0ll; i < (long long)n; ++i)
    if (killed[i] + cnt - unkilled[i] == m) killer[i] = true, ++k;
  for (long long i = 0ll; i < (long long)n; ++i) {
    if (q[i].first == '+') {
      if (killer[q[i].second])
        k > 1 ? printf("Not defined\n") : printf("Truth\n");
      else
        printf("Lie\n");
    } else {
      if (killer[q[i].second])
        k > 1 ? printf("Not defined\n") : printf("Lie\n");
      else
        printf("Truth\n");
    }
  }
  return 0;
}
