#include <bits/stdc++.h>
int n, m, first;
int sus[200000];
int pos[200000];
int neg[200000];
int tp[400000];
int tn[400000];
int compute(int *tree, int pos, int key) {
  if (tree[pos] + key == 3 || tree[pos] == 3)
    tree[pos] = 3;
  else
    tree[pos] = key;
}
int update(int *tree, int left, int right, int key) {
  for (; left <= right;) {
    if (left % 2 == 0)
      left /= 2;
    else {
      compute(tree, left, key);
      left /= 2;
      left++;
    }
    if (right % 2 == 1)
      right /= 2;
    else {
      compute(tree, right, key);
      right /= 2;
      right--;
    }
  }
}
int query(int *tree, int pos) {
  int res = 0;
  for (; pos > 0; pos /= 2) {
    if (tree[pos] == 0) continue;
    if (tree[pos] == 3) res = 3;
    if ((tree[pos] == 2 && res == 1) || (tree[pos] == 1 && res == 2)) res = 3;
    if (res == 0) res = tree[pos];
  }
  if (res == 0)
    return 3;
  else
    return res;
}
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 0; i < n; i++) scanf("%d", &sus[i]);
  for (int i = 0; i < n; i++) {
    if (sus[i] < 0) {
      neg[(-sus[i]) - 1]++;
    } else {
      pos[sus[i] - 1]++;
    }
  }
  int sum = 0;
  for (int i = 0; i < n; i++) sum += neg[i];
  for (int i = 0; i < n; i++) {
    neg[i] = sum - neg[i];
  }
  first = 1;
  for (; first < n; first <<= 1)
    ;
  for (int k = 0; k < n; k++) {
    if (pos[k] + neg[k] == m) {
      if (k > 0) {
        update(tp, first, first + k - 1, 2);
        update(tn, first, first + k - 1, 1);
      }
      if (k < n - 1) {
        update(tp, first + k + 1, first + n - 1, 2);
        update(tn, first + k + 1, first + n - 1, 1);
      }
      update(tp, first + k, first + k, 1);
      update(tn, first + k, first + k, 2);
    }
  }
  for (int i = 0; i < n; i++) {
    if (sus[i] < 0) {
      int res = query(tn, first + (-sus[i]) - 1);
      if (res == 1) printf("Truth\n");
      if (res == 2) printf("Lie\n");
      if (res == 3) printf("Not defined\n");
    } else {
      int res = query(tp, first + sus[i] - 1);
      if (res == 1) printf("Truth\n");
      if (res == 2) printf("Lie\n");
      if (res == 3) printf("Not defined\n");
    }
  }
}
