#include <bits/stdc++.h>
using namespace std;
int ToInt(string& s, int len) {
  int r = 0;
  for (int i = 0, max_ = (len); i < max_; ++i) {
    r *= 10;
    r += s[i] - '0';
  }
  return r;
}
int GCD(int a, int b) { return b != 0 ? GCD(b, a % b) : a; }
int LCM(int a, int b) { return a * (b / GCD(a, b)); }
long long Pow(long long n, long long e) {
  if (e == 0) return 1;
  if (e == 1)
    return n;
  else if (e & 1) {
    long long t = Pow(n, e / 2);
    return n * t * t;
  } else {
    long long t = Pow(n, e / 2);
    return t * t;
  }
}
int x[100005], yes[100005], no[100005];
int main() {
  int N, M, y = 0, n = 0;
  scanf("%d %d", &N, &M);
  for (int i = 0, max_ = (N); i < max_; ++i) {
    scanf("%d", &x[i]);
    if (x[i] > 0) {
      ++yes[x[i]];
      ++y;
    } else if (x[i] < 0) {
      ++no[-x[i]];
      ++n;
    }
  }
  vector<int> v;
  int valid = 0;
  for (int i = (1), max_ = (N + 1); i < max_; ++i) {
    int t = yes[i] + n - no[i];
    if (t == M) {
      ++valid;
      v.push_back(i);
    }
  }
  for (int i = 0, max_ = (N); i < max_; ++i) {
    if (x[i] > 0) {
      bool f = binary_search((v).begin(), (v).end(), x[i]);
      if (!f) {
        printf("Lie\n");
      } else {
        if ((int)(v).size() == 1)
          printf("Truth\n");
        else
          printf("Not defined\n");
      }
    } else {
      bool f = binary_search((v).begin(), (v).end(), -x[i]);
      if (!f) {
        printf("Truth\n");
      } else {
        if ((int)(v).size() == 1)
          printf("Lie\n");
        else
          printf("Not defined\n");
      }
    }
  }
  return 0;
}
