#include <bits/stdc++.h>
using namespace std;
set<int> myst;
const int maxN = 1e5 + 100;
int x[maxN], y[maxN], lie[maxN], truth[maxN], did[maxN], notdi[maxN];
long long int sumdid;
int n, m;
void show() {
  for (int i = 1; i <= n; i++) {
    if (x[i] && myst.find(x[i]) != myst.end()) {
      lie[i]++;
      truth[i] = myst.size() - 1;
    } else if (x[i])
      truth[i]++;
    if (y[i] && myst.find(y[i]) != myst.end()) {
      lie[i] += myst.size() - 1;
      truth[i]++;
    } else if (y[i])
      lie[i]++;
  }
  for (int i = 1; i <= n; i++) {
    if (lie[i] < myst.size() && truth[i] < myst.size() && (lie[i] && truth[i]))
      cout << "Not defined";
    else if (lie[i])
      cout << "Lie";
    else if (truth[i])
      cout << "Truth";
    cout << endl;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    int f;
    cin >> f;
    if (f < 0) {
      x[i] = fabs(f);
      f *= -1;
      notdi[f]++;
    } else {
      y[i] = f;
      did[f]++;
      sumdid++;
    }
  }
  for (int i = 1; i <= n; i++)
    if (sumdid + notdi[i] - did[i] == n - m) myst.insert(i);
  show();
  return 0;
}
