CodeForces 156B Suspects(枚举)

B. Suspects

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

As Sherlock Holmes was investigating a crime, he identified n suspects. He knows for sure that exactly one of them committed the crime. To find out which one did it, the detective lines up the suspects and numbered them from 1 to n. After that, he asked each one: "Which one committed the crime?". Suspect number i answered either "The crime was committed by suspect number ai", or "Suspect number aididn't commit the crime". Also, the suspect could say so about himself (ai = i).

Sherlock Holmes understood for sure that exactly m answers were the truth and all other answers were a lie. Now help him understand this: which suspect lied and which one told the truth?

Input

The first line contains two integers n and m (1 ≤ n ≤ 105, 0 ≤ m ≤ n) — the total number of suspects and the number of suspects who told the truth. Next n lines contain the suspects' answers. The i-th line contains either "+ai" (without the quotes), if the suspect number isays that the crime was committed by suspect number ai, or "-ai" (without the quotes), if the suspect number i says that the suspect number ai didn't commit the crime (ai is an integer, 1 ≤ ai ≤ n).

It is guaranteed that at least one suspect exists, such that if he committed the crime, then exactly m people told the truth.

Output

Print n lines. Line number i should contain "Truth" if suspect number i has told the truth for sure. Print "Lie" if the suspect number ilied for sure and print "Not defined" if he could lie and could tell the truth, too, depending on who committed the crime.

Examples

input

1 1
+1

output

Truth

input

3 2
-1
-2
-3

output

Not defined
Not defined
Not defined

input

4 1
+2
-3
+4
-1

output

Lie
Not defined
Lie

Not defined

枚举i是罪犯，然后看哪些人说了真话，人数等于m说明这个人可能是罪犯

#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
#include <stdio.h>

using namespace std;
#define MAX 100000
int n,m;
int a[MAX+5];
int b[MAX+5];
int f[MAX+5];
int tag[MAX+5];
int main()
{
    scanf("%d%d",&n,&m);
    int x;
    memset(a,0,sizeof(a));
    memset(b,0,sizeof(b));
    int sum=0;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&f[i]);
        if(f[i]>0)
        {
            a[f[i]]++;
        }
        else
        {
            b[-f[i]]++;
            sum++;
        }
    }
    memset(tag,0,sizeof(tag));
    int k=0;
    for(int i=1;i<=n;i++)
    {
        if(a[i]+sum-b[i]==m)
        {
            tag[i]=1;
            k++;
        }
    }
    for(int i=1;i<=n;i++)
    {
        if(f[i]>0)
        {
            if(tag[f[i]]&&k==1)
                printf("Truthn");
            else if(!tag[f[i]])
                printf("Lien");
            else
                printf("Not definedn");
        }
        else
        {
            if(!tag[-f[i]])
                printf("Truthn");
            else if(tag[-f[i]]&&k==1)
                printf("Lien");
            else
                printf("Not definedn");
        }
    }
    return 0;
}