Balloons

A group of children came to a toy store. Each of them wants to buy some balloons. The children like variety, so none of them wants to own two balloons of the same colour. In other words, all balloons bought by a single child must have different colours. Help the shop assistant decide whether every child's order can be filled from the store's current stock.

Write a program that:

• reads the store's stock and the children's orders from standard input,
• checks whether all children can be satisfied,
• writes the result to standard output.

The first line contains two integers $n$ and $m$ ($1 \le n \le 200000$, $2 \le m \le 200000$), separated by a single space, where $n$ is the number of distinct balloon colours in the store and $m$ is the number of children.

The second line contains $n$ integers $a_i$ ($1 \le a_i \le 1000000$), separated by spaces, giving the stock of each colour.

The third line contains $m$ integers $b_i$ ($1 \le b_i \le 1000000$), separated by spaces, giving the children's orders. $b_i = k$ means the $i$-th child wants to buy $k$ balloons, all of different colours.

Print TAK (Polish for yes) on the only line if every child's order can be filled, and NIE (Polish for no) otherwise.