# Problem G

Samlokur

Languages
en
is
Atli is a big fan of sandwiches. The last few years he has developed a very specific taste in sandwiches. The store Atli usually goes to to buy sandwiches has closed down for the next $k$ days due to COVID. This worries Atli since he has to get his daily sandwiches. He has $n$ sandwiches in his fridge currently. Each sandwich can be described by two numbers $a_ i, b_ i$ where $a_ i$ is the quality of the $i$-th sandwich and $b_ i$ is the number of days until it goes bad. Atli’s specific tastes mean that he will eat exactly one sandwich for lunch and another one for dinner. The total quality of these sandwiches must be at least $9$. He will neither eat sandwiches of quality less than $4$ nor sandwiches that have gone bad. If a sandwich goes bad in $x$ days it can be eaten on day number $x$ or earlier. For example a sandwich with $b_ i = 1$ must be eaten on the first day or be discarded. Now Atli is wondering if these sandwiches will last him these $k$ days.

## Input

The first line of the input contains two integers $1 \leq n \leq 10^5$ and $1 \leq k \leq 10^5$, the number of sandwiches and the number of days the store is closed. The next line contains $n$ integers $0 \leq a_ i \leq 10$, the quality of the sandwiches. Finally the last line of the input contains $n$ integers $0 \leq b_ i \leq 10^9$, how many days until each of the sandwiches goes bad.

## Output

If the sandwiches will last Atli these $k$ days print `Jebb`. Otherwise print `Neibb`.

## Scoring

Group |
Points |
Constraints |

1 |
20 |
$n \leq 8$ |

2 |
20 |
$n \leq 10^2$ |

3 |
20 |
$n \leq 10^3$ |

4 |
40 |
No further constraints. |

Sample Input 1 | Sample Output 1 |
---|---|

8 3 4 4 8 7 2 9 1 6 1 2 3 4 5 6 7 8 |
Jebb |

Sample Input 2 | Sample Output 2 |
---|---|

4 2 5 6 7 8 1 1 1 2 |
Neibb |