#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, temp, total_safe = 0, count = 0;
  cin >> n >> m;
  vector<pair<bool, int>> v(n);
  unordered_map<int, int> sus, safe;
  for (int i = 0; i < n; i++) {
    cin >> temp;
    if (temp < 0) {
      total_safe++;
      temp = -temp - 1;
      v[i] = pair<bool, int>(false, temp);
      safe[temp]++;
    } else {
      temp--;
      v[i] = pair<bool, int>(true, temp);
      sus[temp]++;
    }
  }
  bool maybe[n];
  for (int i = 0; i < n; i++) {
    temp = sus[i] + total_safe - safe[i];
    if (temp == m) {
      maybe[i] = true;
      count++;
    }
  }
  for (int i = 0; i < n; i++) {
    if (v[i].first) {
      if (!maybe[v[i].second])
        cout << "Lie" << endl;
      else if (count == 1)
        cout << "Truth" << endl;
      else
        cout << "Not defined" << endl;
    } else {
      if (!maybe[v[i].second])
        cout << "Truth" << endl;
      else if (count == 1)
        cout << "Lie" << endl;
      else
        cout << "Not defined" << endl;
    }
  }
  return 0;
}
