A. No More Ties!
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

In the first contest, there was a problem: 7 contestants were classified, and there was a tie in scores among 14 participants in the seventh position! The organizers do not like having to break ties based on accumulated time, but with so many contestants tied, we had no other option.

Now we want to know if this will happen in the second qualifying round. In this qualifying round, $$$n$$$ contestants will participate, and the top $$$k$$$ will be classified, with $$$1 \leq k \lt n$$$. We have the $$$n$$$ scores of the participants, and we want to know if there will be ties in scores that prevent us from separating the top $$$k$$$ participants from the others without having to resort to penalty time.

Input

The input starts with an integer $$$t$$$ indicating the number of cases.

Each case begins with a pair of integers $$$n$$$ and $$$k$$$, with $$$1 \leq k \lt n$$$.

The following line contains $$$n$$$ integers indicating the scores of the participants, $$$p_i$$$.

Output

For each case, output "EMPATE" or "BIEN" depending on whether there are ties that prevent separating the top $$$k$$$ contestants from the others without looking at the penalty time.

Scoring

$$$1 \leq t \leq 100$$$

$$$0 \leq p_i \leq 10^6$$$

$$$1 \leq k \lt n$$$

33 Points: $$$n \leq 100$$$

33 Points: $$$n \leq 1000$$$

34 Points: $$$n \leq 10000$$$

Example
Input
5
2 1
1 1
10 5
5 8 0 9 2 0 3 0 1 1
5 1
8 13 10 14 1
3 1
0 1 1
10 8
5 7 4 2 3 2 2 7 7 3
Output
EMPATE
BIEN
BIEN
EMPATE
EMPATE