#include <bits/stdc++.h>
const int N = 100010;
int n, m, a[N], b[N], as[N], s[N], nb, nans, ok;
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n && ~scanf("%d", &s[i]); i++)
    if (s[i] > 0)
      a[s[i]]++;
    else
      nb++, b[-s[i]]++;
  for (int i = 1; i <= n; i++)
    if (a[i] + nb - b[i] == m) as[i] = 1, nans++;
  nans = nans == 1 ? 1 : 0;
  for (int i = 0; i < n; i++)
    if (s[i] > 0)
      puts(!as[s[i]] ? "Lie" : nans ? "Truth" : "Not defined");
    else
      puts(!as[-s[i]] ? "Truth" : nans ? "Lie" : "Not defined");
}
